#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;


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

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

ll x,y;
bool check(ll a,ll b,ll c){
	return x-a*b==c&&y-a*c==b; 
}

void solve(){
	int t;
	cin>>t;
	while(t--){
		cin>>x>>y;
		ll ans=0;
		for(ll c=1;c*c<=max(x,y);++c){
			ll d=y*y-4*c*(x-c);
			if(d<0)continue;
			if((y+(ll)sqrt(y*y-4*c*(x-c)))%(2*c)==0){
				ll a=(y+sqrt(y*y-4*c*(x-c)))/(2*c);
				ll b=y-a*c;
				if(a>0&&b>0&&check(a,b,c))++ans;
			}
			if((y-(ll)sqrt(y*y-4*c*(x-c)))%(2*c)==0){
				ll a=(y-sqrt(y*y-4*c*(x-c)))/(2*c);
				ll b=y-a*c;
				if(a>0&&b>0&&check(a,b,c))++ans;
			}
		}
		cout<<ans<<"\n";
	}
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	solve();
	return 0;
}