#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld double
#define llu unsigned long long
#define rep(i,x,y)  for(ll i=int(x);i<int(y);++i)
#define For(i,x,y)  for(ll i=int(x);i<=int(y);++i)
#define FOr(i,x,y)  for(ll i=int(x);i>=int(y);--i)
#define pi acos(-1) 
#define mk make_pair
#define pa pair<ll,ll>
#define lf else if
#define IL inline
#define sqr(x)      ((x)*(x))
#define Mul(x,y)    ((x)=1LL*(x)*(y)%mod)
#define Add(x,y)    ((x)=((x)+(y))%mod)
#define E(x)        return writeln(x),0
#define LL          (long long)
#define p(x)        printf("~%lld~\n",LL(x))
#define pp(x,y)     printf("~~%lld %lld~~\n",LL(x),LL(y))
#define ppp(x,y,z)  printf("~~~%lld %lld %lld~~~\n",LL(x),LL(y),LL(z))
#define pppp(a,b,c,d)   printf("~~~%lld %lld %lld %lld\n",LL(a),LL(b),LL(c),LL(d))
#define f_in(x)     freopen(x".in","r",stdin)
#define f_out(x)    freopen(x".out","w",stdout)
#define open(x)     f_in(x),f_out(x)
#define fi first
#define se second
#define y1          fafa____
typedef complex<double> E;
namespace SHENZHEBEI{
#ifdef LOCAL
    struct _{_(){freopen("cf.in","r",stdin);}}_; 
#endif 
#define NEG 1
    static const int GYN=2333333;
    char SZB[GYN],*SSS=SZB,*TTT=SZB;
    inline char gc(){   if (SSS==TTT){  TTT=(SSS=SZB)+fread(SZB,1,GYN,stdin); if (SSS==TTT) 

return '\n';  }   return *SSS++;    }
#define gc getchar
#if NEG
    inline ll read(){    ll x=0,g=1; char ch=gc();   for (;!isdigit(ch);ch=gc()) if 

(ch=='-') g=-1;  for (;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x*g; }
    inline void write(ll x){    if (x<0) putchar('-'),x=-x;  if (x>=10)   write(x/10);    

putchar(x%10+'0');  }
#else
    inline ll read(){    ll x=0; char ch=gc();   for (;!isdigit(ch);ch=gc());    for 

(;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x;   }
    inline void write(ll x){    if (x>=10)   write(x/10);    putchar(x%10+'0');  }
#endif
    inline char readchar(){ char ch=gc();   for(;isspace(ch);ch=gc());  return ch;  }
    inline ll readstr(char *s){ char ch=gc();   int cur=0;  for(;isspace(ch);ch=gc());      

for(;!isspace(ch);ch=gc())  s[cur++]=ch;    s[cur]='\0';    return cur; }
    void Print(long long *a,int s,int t){For(i,s,t)printf("%lld ",a[i]);puts("");}
    void Print(int *a,int s,int t){For(i,s,t)printf("%d ",a[i]);puts("");}
    void Print(char *a,int s,int t){For(i,s,t)putchar(a[i]);puts("");}
    void writeln(ll x){write(x),puts("");}
    void Max(ll &x,ll y){x=x<y?y:x;}
    ll max(ll x,ll y){return x<y?y:x;}
}using namespace SHENZHEBEI;
const ll N=2001000,mod=1e9+7;
ll n,m,mx,ans,fib[1000],id,cnt,lzh;
vector<pa>answ[1000];
int main(){
	ll Q=read();
	fib[0]=fib[1]=1;For(i,2,88)fib[i]=fib[i-1]+fib[i-2];
	answ[1].push_back(mk(1,2));
	answ[1].push_back(mk(1,3));
	answ[1].push_back(mk(1,4));
	For(i,1,87){
		rep(j,0,answ[i].size()){
			ll x=answ[i][j].se,y=answ[i][j].se+answ[i][j].fi;
			for(;y<=fib[i]+fib[i+3];y+=x)
				answ[i+1].push_back(mk(x,y));
		}
	}
	for(;Q--;){
		n=read(),m=read();
		mx=ans=0;
		if (n>m)swap(n,m);
		For(i,1,88)if (fib[i]<=n&&fib[i+1]<=m)mx=i;
		if (n==1||(n+m==4)){write(1),putchar(' '),writeln(n*m%mod);continue;}
		rep(i,0,answ[mx-1].size()){
			ll x=answ[mx-1][i].fi,y=answ[mx-1][i].se;
			if (y<=n)Add(ans,(m-x)/y);
			if (y<=m)Add(ans,(n-x)/y);
		}
		write(mx),putchar(' ');writeln(ans);
	}
}

Measured memory_bytes: 4096