#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint T;
llint x, y;

inline llint calc(llint i)
{
	llint a = i+1, d = (y-x)/i;
	llint b = (x-d)/(a+1), c = b + d;
	if(x-d > 0 && (x-d)%(a+1) == 0 && a*c + b == y && a*b + c == x) return 1;
	return 0;
}

inline llint calc2(llint i)
{
	llint a = x/i-1, ans = 0;
	if(a >= 1 && (a+1)*i == x) ans++;
	return ans;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> T;
	for(int t = 0; t < T; t++){
		cin >> x >> y;
		if(x > y) swap(x, y);
		
		llint ans = 0;
		for(int i = 1; i*i <= y-x; i++){
			if((y-x)%i) continue;
			ans += calc(i);
			if(i*i < y-x) ans += calc((y-x)/i);
		}
		if(y-x == 0){
			for(int i = 1; i*i <= x; i++){
				if((y-x)%i) continue;
				ans += calc2(i);
				if(i*i < x) ans += calc2(x/i);
			}
			ans += x-1;
			if(x % 2 == 0) ans--;
		}
		cout << ans << endl;
	}
	
	return 0;
}