#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000000

int main(){
	
	int S;
	cin>>S;
	
	for(int i=0;i<S;i++){
		int X,Y;
		scanf("%d %d",&X,&Y);
		if(X<Y)swap(X,Y);
		int Z = X+Y;
		long long ans = 0;
		for(int j=1;j*j<=Z;j++){
			if(Z%j==0){
				int a = j-1;
				if(a>=2&&(X-Y)%(a-1)==0){
					int x = Z/j;
					int y = (X-Y)/(a-1);
					
					if((x+y)%2==0&&(x-y)%2==0&&(x+y)>=2&&(x-y)>=2)ans++;
				}
				
				if(a!=Z/j-1){
					a = Z/j-1;
					if(a>=2&&(X-Y)%(a-1)==0){
						int x = j;
						int y = (X-Y)/(a-1);
						
						if((x+y)%2==0&&(x-y)%2==0&&(x+y)>=2&&(x-y)>=2)ans++;
					}
				}
			}
		}
		printf("%lld\n",ans);
	}
	
	return 0;
}