#include <bits/stdc++.h>
using namespace std;
#define rep2(i,m,n) for (int i = (m); i < (n); ++i)
#define rep(i,n) rep2(i,0,n)
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> P;
template<typename T> struct V : vector<T> { using vector<T>::vector; };
V() -> V<int>;
V(size_t) -> V<int>;
template<typename T> V(size_t, T) -> V<T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
const int INF = 1<<30;
const ll LINF = 1LL<<61;
const ll MOD = 1000000007;

struct Osa_k
{
    int N;
    vector<int> min_factor;
    Osa_k(int n = 2020202) : N(n), min_factor(N)
    {
        preprocess();
    }
    void preprocess()
    {
        iota(min_factor.begin(), min_factor.end(), 0);
        for(int i = 2; i*i < N; i++)
        {
            if(min_factor[i] < i) continue;
            for(int j = i*i; j < N; j+=i)
            {
                if(min_factor[j] == j)
                    min_factor[j] = i;
            }
        }
    }
    vector<int> factor_vec(int x) //O(logx)
    {
        vector<int> res;
        while(x > 1)
        {
            res.push_back(min_factor[x]);
            x /= min_factor[x];
        }
        return res;
    }
    map<int, int> factor_map(int x)
    {
        map<int, int> res;
        while(x > 1)
        {
            res[min_factor[x]]++;
            x /= min_factor[x];
        }
        return res;
    }
    vector<int> divisor(int x)
    {
        auto fac = factor_map(x);
        vector<int> res = {1};
        for(auto p:fac)
        {
            vector<int> divs;
            int d = 1;
            rep(i,p.second+1)
            {
                for(auto y:res)
                {
                    divs.push_back(d * y);
                }
                d *= p.first;
            }
            swap(res, divs);
        }
        // sort(res.begin(), res.end());
        return res;
    }
};

void solve(Osa_k &osak)
{
    int X, Y;
    cin >> X >> Y;
    int N = X + Y;
    vector<int> div = osak.divisor(N);
    // sort(div.begin(), div.end());
    int n = div.size();
    int ans = 0;
    for(auto x:div)
    {
        int a = x - 1;
        int K = N / x;
        if(a > X || a > Y) continue;
        if(X - K <= 0 || Y - K <= 0) continue;
        int P = X - K, Q = Y - K, R = a - 1;
        if(R <= 0) continue;
        if(P%R != 0 || P%R != 0) continue;
        ans++;
    }
    printf("%d\n",ans);

    return;
}

int main()
{
    Osa_k osak;
    int s;
    cin >> s;
    rep(i,s) solve(osak);
    return 0;
}