#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

inline int topbit(unsigned long long x){
	return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
	return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){//popcount%2
	return __builtin_parity(x);
}



template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e15;

int main(){
    ios;
    ll s;
    cin >> s;
    while(s--){
        ll x,y;
        cin >>  x >> y;
        if(x<y) swap(x,y);
        ll z=x-y;
        ll ans=0;
        if(z==0){
            cout << x-1 << endl;
            continue;
        }
        vector<ll> p;
        for(ll i=1;i*i<=z;i++){
            if(z%i==0){
                if(i*i==z){
                    p.push_back(i);
                }
                else{
                    p.push_back(i);
                    p.push_back(z/i);
                }
            }
        }
        for(auto q:p){
            ll a=q+1;
            if(a*x>y && a*y>x){
                if((a*x-y)%(a*a-1)==0 && (a*y-x)%(a*a-1)==0){
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}