#include <bits/stdc++.h>
using namespace std;
long long n,m;
map<int, int>a;
void pt(int s)
{
    for(int i=2;i<=sqrt(s);i++)
        {
            while(s%i==0)
                {
                    a[i]++;
                    s/=i;
                }
        }
    if(s>1) a[s]++;
}
int main()
{
 //   freopen("uocso.inp","r",stdin);
 //   freopen("uocso.out","w",stdout);
    int T;
    cin>>T;
    while(T--)
        {
            a.clear();
            cin>>n>>m;
            pt(n);
            pt(m);
            int dem=1;
            for(auto x: a)
                {
                    dem=dem*((x.second)+1);
                }
            cout<<dem<<endl;
        }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int count(int a, int b)
{
  map<int, int> f;
  int res = 1;
  while (a % 2 == 0)
  {
    f[2]++;
    a /= 2;
  }
  for (int i = 3; i <= sqrt(a); i = i + 2)
    while (a % i == 0)
    {
      f[i]++;
      a /= i;
    }
  if (a > 2)
    f[a]++;
  while (b % 2 == 0)
  {
    f[2]++;
    b /= 2;
  }
  for (int i = 3; i <= sqrt(b); i = i + 2)
    while (b % i == 0)
    {
      f[i]++;
      b /= i;
    }
  if (b > 2)
    f[b]++;
  for (auto i : f)
    res *= i.second + 1;
  return res;
}
int main()
{
  int t, a, b;
  cin >> t;
  while (t--)
  {
    cin >> a >> b;
    cout << count(a, b) << '\n';
  }
  return 0;
}