#include<bits/stdc++.h>usingnamespace std;#define ll long long#define re register#define gc get_char#define pc putchar#define cs constnamespace IO{namespace IOONLY{
cs int Rlen=1<<18|1;char buf[Rlen],*p1,*p2;}inlinecharget_char(){usingnamespace IOONLY;return(p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;}inlineintgetint(){
re int num;
re char c;while(!isdigit(c=gc()));num=c^48;while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);return num;}inlinevoidoutint(ll a){staticchar ch[23];if(a==0)pc('0');while(a)ch[++ch[0]]=a-a/10*10,a/=10;while(ch[0])pc(ch[ch[0]--]^48);}}usingnamespace IO;
cs int P=10000007;int mu[P],prime[P],pcnt;bool mark[P];
ll sum[P];inlinevoidlinear_sieves(int len=P-7){
mu[1]=1;for(int re i=2;i<=len;++i){if(!mark[i])mu[i]=-1,prime[++pcnt]=i,sum[i]=1;for(int re j=1;i*prime[j]<=len;++j){
mark[i*prime[j]]=true;if(i%prime[j]==0){sum[i*prime[j]]=mu[i];break;}
mu[i*prime[j]]=-mu[i];
sum[i*prime[j]]=mu[i]-sum[i];}}for(int re i=1;i<=len;++i)sum[i]+=sum[i-1];}inline ll solve(int n,int m){if(n>m)swap(n,m);
ll ans=0;for(int re i=1,j;i<=n;i=j+1){
j=min(n/(n/i),m/(m/i));
ans+=(ll)(n/i)*(m/i)*(sum[j]-sum[i-1]);}return ans;}signedmain(){linear_sieves();for(int re T=getint();T--;pc('\n'))outint(solve(getint(),getint()));return0;}