#include <bits/stdc++.h>
#include <type_traits>
using namespace std;

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int Cnt(int a,int b){
	//cerr<<a<<" "<<b<<endl;
	if(a>b)swap(a,b);
	if(a==0)return 0;
	return Cnt(b%a,a)+1;
}

/*
signed main(){
	int N=40;
	FOR(i,1,N+1)
		FOR(j,1,N+1){
			print(Cnt(i,j),j==N?1:2);
		}
}
*/

const int V=1000000000000000000LL;
const int mod=1000000007;
int fib[1000],s;
vector<pi> cand[1000];

void dfs(int cur,int a,int b,int mc){
	//cerr<<cur<<" "<<a<<" "<<b<<" "<<mc<<endl;
	if(cur==mc-1){
		cand[mc].PB(pi(b,a+b));
		return;
	}
	int xBase=a*fib[mc-1-(cur+1)];
	if(mc-1-(cur+2)>=0)
		xBase+=b*fib[mc-1-(cur+2)];
	int yBase=a*fib[mc-(cur+1)]+b*fib[mc-(cur+2)];
	int k=(cur==0?2:1);
	while(1){
		int x=xBase+b*k*fib[mc-1-(cur+1)];
		int y=yBase+b*k*fib[mc-(cur+1)];
		if(x<fib[mc+2]||y<fib[mc+1]){
			dfs(cur+1,b,a+b*k,mc);
		}else
			break;
		k++;
	}
}

void Init(){
	fib[s++]=1;
	fib[s++]=1;
	while(fib[s-1]<=V){
		fib[s]=fib[s-1]+fib[s-2];
		s++;
	}
	int mc=2;
	while(fib[mc+1]<=V){
		dfs(0,0,1,mc);
		mc++;
	}
}

void Solve(){
	int y=read(),x=read();
	if(y>x)swap(y,x);
	int maxC=1;
	while(fib[maxC+1]<=y&&fib[maxC+2]<=x){
		maxC++;
	}
	if(maxC==1){
		print(maxC,2);
		print(x*y%mod);
		return;
	}
	cerr<<cand[maxC]<<endl;
	int ans=0;
	REP(_,2){
		for(auto kv:cand[maxC]){
			int a=kv.first,b=kv.second;
			if(a<=y&&b<=x){
				ans+=1+(x-b)/a;
				ans%=mod;
			}
		}
		swap(x,y);
	}
	print(maxC,2);
	print(ans);
}

signed main(){
	Init();
	cerr<<"Init Done"<<endl;
	int q=read();
	REP(_,q){
		Solve();
	}
}


Measured memory_bytes: 6272