#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;

#define all(x)  x.begin(),x.end()
#define v(x) vector<x>
#define nl '\n'
#define fxd(x) fixed << setprecision(x)
template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;

v(ll) nums(1000003,2);
void sieveofmazen()
{
    ll sz = 1000003;
    nums[0] = 0;
    nums[1] = 1;
    for (ll i = 2; i < sz; i++)
    {
        for (ll j = 2*i; j < sz; j+=i)
        {
            nums[j]++;
        }
    }
    return;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    sieveofmazen();
    int t; cin >> t;
    while (t--)
    {
        ll a , b; cin >> a >> b;
        cout << nums[__gcd(a,b)] << nl;
    }
    
}