#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
typedef long long LL;
typedef vector<LL> Poly;
const LL MOD=1000000007;
const int H=6;
LL gcd(LL a,LL b){return !b?a:gcd(b,a%b);
}
LL lcm(LL a,LL b){return a*b/gcd(a,b);
}
LL quickpow(LL a,LL n){LL ans=1;while(n){if(n&1) ans=(ans*a)%MOD;a=(a*a)%MOD;n>>=1;}return ans;
}
LL inverse(LL a){return quickpow(a,MOD-2);
}
void print(Poly a){for(int i=0;i<a.size();i++){cout<<a[i]<<" ";}cout<<endl;
}
Poly operator * (Poly a,LL b){for(int i=0;i<a.size();i++){a[i]*=b;a[i]%=MOD;}return a;
}
Poly operator / (Poly a,LL b){return a*inverse(b);
}
Poly operator + (Poly a,Poly b){Poly c;int n=max(a.size(),b.size());c.resize(n);for(int i=0;i<a.size();i++){c[i]+=a[i];c[i]%=MOD;}for(int i=0;i<b.size();i++){c[i]+=b[i];c[i]%=MOD;}return c;
}
Poly operator * (Poly a,Poly b){Poly c;c.resize(a.size()+b.size()-1);for(int i=0;i<a.size();i++){for(int j=0;j<b.size();j++){c[i+j]+=a[i]*b[j]%MOD;c[i+j]%=MOD;}}return c;
}
const int SIZEN=1000010;
LL calc_presum_with(Poly a,LL ps[]){LL ans=0;for(int i=0;i<a.size();i++){ans+=(a[i]*ps[i])%MOD;ans%=MOD;}return ans;
}
Poly give_Fsum_L(void){//the component without gcdstatic LL A[10];A[0]=1;Poly ans(A,A+1);A[0]=0,A[1]=1;ans=ans*Poly(A,A+2);A[0]=1,A[1]=1;ans=ans*Poly(A,A+2);A[0]=1,A[1]=2;ans=ans*Poly(A,A+2);ans=ans/3;A[0]=0,A[1]=0,A[2]=-3;ans=ans+Poly(A,A+3);return ans;
}
LL G[SIZEN]={0};
LL phi[SIZEN];
LL P[SIZEN][H],PG[SIZEN][H];
void work(LL N,LL M){static LL A[10]; if(N>M) swap(N,M);//N是较小者A[0]=M+1,A[1]=-1;Poly D(A,A+2);A[0]=N+1,A[1]=-1;D=D*Poly(A,A+2);Poly F=give_Fsum_L();Poly F1=D*F;LL ans=0;ans+=calc_presum_with(F1,P[N]);ans%=MOD;A[0]=2;Poly F2=D*Poly(A,A+1);ans+=calc_presum_with(F2,PG[N]);ans%=MOD;ans=(ans+MOD)%MOD;printf("%I64d\n",ans);
}
void prepare(void){for(int i=1;i<SIZEN;i++){//精妙的求phi方法 phi[i]+=i;for(int j=i+i;j<SIZEN;j+=i){phi[j]-=phi[i];}}for(int g=1;g<SIZEN;g++){//求gcd(x,i)的前缀和 G[g]+=g;G[g]%=MOD;for(int x=2*g,d=2;x<SIZEN;x+=g,d++){G[x]+=(g*phi[d]%MOD);G[x]%=MOD;}}for(int i=0;i<H;i++){P[0][i]=PG[0][i]=0;}for(LL x=1;x<SIZEN;x++){LL p=1;for(int i=0;i<H;i++){P[x][i]=(P[x-1][i]+p)%MOD;PG[x][i]=(PG[x-1][i]+(p*G[x])%MOD)%MOD;p=(p*x)%MOD;}}
}
int main(){prepare();LL T,N,M;scanf("%I64d",&T);while(T--){scanf("%I64d%I64d",&N,&M);work(N,M);}return 0;
}