#include<bits/stdc++.h>
#define FILE "read"
using namespace std;
typedef long long ll;
const int mod=(int)1e9+7,MAXN=(int)1e6,D=50;
ll g[MAXN+D],sum[MAXN+D],sumv[MAXN+D];
inline int read(){
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
ll fast(ll a,ll b){ll temp(1);for(;b;b>>=1,a=a*a%mod)if(b&1)temp=temp*a%mod;return temp;}
void pre(){
g[1]=1; for(int i=2;i<=MAXN;++i) g[i]=(g[i-1]+g[i-2])%mod;
for(int i=1;i<=MAXN;++i){
ll temp=fast(g[i],mod-2);
for(int j=(i<<1);j<=MAXN;j+=i)
g[j]=g[j]*temp%mod;
}
sum[0]=1; for(int i=1;i<=MAXN;++i) sum[i]=sum[i-1]*g[i]%mod;
sumv[0]=1; for(int i=1;i<=MAXN;++i) sumv[i]=fast(sum[i],mod-2);
}
void solve(){
int n=read(),m=read(),last; ll ans(1);
if(n>m) swap(n,m);
for(int i=1;i<=n;i=last+1){
last=min(n/(n/i),m/(m/i));
ans=ans*fast(sum[last]*sumv[i-1]%mod,(ll)(n/i)*(m/i))%mod;
}
printf("%lld\n",ans);
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
pre(); for(int T=read();T;--T) solve();
return 0;
}