#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <map>
using namespace std;
typedef long long int ll;

ll X,Y;

ll count_res(ll i,ll j){
    if(j<2)return 0;
    ll a=i-1;
    if(a==1){
        if(X-j!=0||Y-j!=0)return 0;
        return j-2;
    }
    else{
        if((X-j)%(a-1))return 0;
        if((Y-j)%(a-1))return 0;
        ll b=(X-j)/(a-1);
        ll c=(Y-j)/(a-1);
        return b>=1&&c>=1&&b+c==j;
    }
}


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while(q--){
        cin >> X >> Y;
        int x=X+Y;
        ll res=0;
        for(int i=2;i*i<=x;i++){
            if(x%i==0){
                res+=count_res(i,x/i);
                if(x/i!=i)res+=count_res(x/i,i);
            }
        }
        cout << res << "\n";
    }
}