#include<bits/stdc++.h>#define N 50005#define LL long longusingnamespace std;int g[N], mu[N], s[N], x[N], p[N], cnt, maxn =50000;
LL ans, z =1;intmain(){int i, j, n, m, t, l, r, T;
mu[1]=1;for(i =2; i <= maxn; i++){if(!x[i]) x[i]=1, p[++cnt]= i, mu[i]=-1;for(j =1; j <= cnt; j++){
t = i * p[j];if(t > maxn)break;
x[t]=1;if(i % p[j]==0)break;
mu[t]=-mu[i];}}for(i =1; i <= maxn; i++) s[i]= s[i -1]+ mu[i];for(i =1; i <= maxn; i++){for(l =1; l <= i; l = r +1){
r = i /(i / l);
g[i]+=(r - l +1)*(i / l);}}scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);if(n > m)swap(n, m);
ans =0;for(l =1; l <= n; l = r +1){
r =min(n /(n / l), m /(m / l));
ans += z *(s[r]- s[l -1])* g[n / l]* g[m / l];}printf("%lld\n", ans);}return0;}