#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

template<typename T>
vector<T> divisor_list(T x){
    vector<T> res;
    for(T i=1;i*i<=x;i++){
        if (x%i==0) {
            res.push_back(i);
            if (i*i!=x) res.push_back(x/i);
        }
    }
    return res;
}

ll x,y;

void solve(){
  vector<ll> Dy=divisor_list(y);
  ll ans=0;
  for(int d:Dy){
    if(d%2==0) continue;
    ll b=(d+1)/2;
    if(2*b*(b-1)*y%((2*b-1)*x)!=0) continue;
    ll A=2*b*(b-1)*y/((2*b-1)*x);
    if(2*b-1<A) ans+=1;
  }
  //cout << ans << endl;
  for(int d:Dy){
    if(d%2==0) continue;
    ll a=(d+1)/2;
    if(2*(a*a+a-1)*y%((2*a-1)*(y-x))!=0) continue;
    ll B=2*(a*a+a-1)*y/((2*a-1)*(y-x));
    if(2*a-1<B) ans+=1;
  }
  //cout << ans << endl;
  if(y>2*x){
    ans+=10e7/y;
  }
  if(2*(y-x)<y){
    ans+=10e7/y;
  }
  cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    int n;cin >> n;
    rep(i,n){
      cin >> x >> y;
      solve();
    }
}