#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 50010
using namespace std;
typedef long long ll;
int n,m,cnt,prime[MAXN],check[MAXN],D[MAXN],num[MAXN],mu[MAXN];
inline int read(){
	int x=0,f=1;  char ch=getchar();
	while(ch>'9'||ch<'0')  {if(ch=='-')  f=-1;  ch=getchar();}
	while(ch>='0'&&ch<='9')  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void Init(){
	int N=50000;  D[1]=num[1]=mu[1]=1;
	for(int i=2;i<=N;++i){
		if(!check[i])  prime[++cnt]=i,D[i]=2,num[i]=1,mu[i]=-1;
		for(int j=1;j<=cnt&&prime[j]*i<=N;++j){
			check[prime[j]*i]=1;
			if(i%prime[j]==0){
				D[prime[j]*i]=D[i]/(num[i]+1)*(num[i]+2);
				num[prime[j]*i]=num[i]+1;
				mu[prime[j]*i]=0;
				break;
			}
			else{
				D[prime[j]*i]=D[i]*2;
				num[prime[j]*i]=1;
				mu[prime[j]*i]=-mu[i];
			}
		}
	}
	for(int i=1;i<=N;++i) D[i]+=D[i-1];
	for(int i=1;i<=N;++i) mu[i]+=mu[i-1];
}
void solve(){
	n=read();  m=read();  ll ans=0;
	if(n>m)  swap(n,m);
	for(int i=1,last;i<=n;i=last+1){
		last=min(n/(n/i),m/(m/i));
		ans+=1LL*(mu[last]-mu[i-1])*D[n/i]*D[m/i];
	}
	printf("%lld\n",ans);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	Init(); int T=read(); while(T--) solve();
	return 0;
}