#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

int const xn=5e4+;

int cnt,pri[xn];

ll f[xn],mu[xn];

bool vis[xn];

int rd()

{

  int ret=,f=; char ch=getchar();

  while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return f?ret:-ret;

}

void init()

{

  int mx=5e4; mu[]=;

  for(int i=;i<=mx;i++)

    {

      if(!vis[i])pri[++cnt]=i,mu[i]=-;

      for(int j=;j<=cnt&&(ll)i*pri[j]<=mx;j++)

    {

      vis[i*pri[j]]=;

      if(i%pri[j])mu[i*pri[j]]=-mu[i];

      else break;

    }

    }

  for(int i=;i<=mx;i++)mu[i]+=mu[i-];

  for(int n=;n<=mx;n++)

    for(int i=,j;i<=n;i=j+)

      {

    j=n/(n/i);

    f[n]+=(ll)(n/i)*(j-i+);//

      }

}

int main()

{

  int T=rd(); init();

  while(T--)

    {

      int n=rd(),m=rd(); int mn=min(n,m); ll ans=;//

      for(int i=,j;i<=mn;i=j+)

    {

      j=min(n/(n/i),m/(m/i));

      ans+=(mu[j]-mu[i-])*f[n/i]*f[m/i];

    }

      printf("%lld\n",ans);

    }

  return ;

}