Code:
#include<bits/stdc++.h>
#define maxn 4020002
#define ll long long
#define M 4000001
using namespace std;
#define O2 __attribute__((optimize("-O2")))
char *p1,*p2,buf[100000];
#define nc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int rd() {int x=0; char c=nc(); while(c<48) c=nc(); while(c>47) x=(((x<<2)+x)<<1)+(c^48),c=nc(); return x;}
void setIO(string s)
{
string in=s+".in";
string out=s+".out";
freopen(in.c_str(),"r",stdin);
freopen(out.c_str(),"w",stdout);
}
int cnt;
bool vis[maxn];
int prime[maxn], mu[maxn];
ll g[maxn],mod=1,sum[maxn];
O2 inline void Init()
{
int i,j;
mu[1]=1;
for(i=1;i<=30;++i) mod=mod*2;
for(i=2;i<=M;++i)
{
if(!vis[i]) prime[++cnt]=i, mu[i]=-1;
for(j=1;j<=cnt&&1ll*prime[j]*i<=M;++j)
{
vis[prime[j]*i]=1;
if(i%prime[j]==0)
{
mu[i*prime[j]]=0;
break;
}
mu[i*prime[j]]=-mu[i];
}
}
for(i=1;i<=M;++i)
for(j=1;1ll*i*j<=M;++j)
if(mu[j]) g[i*j]+=mu[i]*i, g[i*j]%mod;
for(i=1;i<=M;++i) g[i]=(1ll*g[i]*i+g[i-1]+mod)%mod;
for(i=1;i<=M;++i) sum[i]=(1ll*(i+1)*i/2)%mod;
}
O2 int main()
{
// setIO("input");
Init();
int T,n,m;
T=rd();
while(T--)
{
n=rd(), m=rd();
if(n>m) swap(n,m);
int i,j;
ll re=0;
for(i=1;i<=n;i=j+1)
{
j=min(n/(n/i), m/(m/i));
re=(re + (1ll*sum[n/i]*sum[m/i]*(g[j]-g[i-1])%mod)%mod + mod)%mod;
}
printf("%lld\n",re);
}
return 0;
}