#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint T;
  cin >> T;
  while(T--) {
    lint X, Y;
    cin >> X >> Y;
    vector<lint> div;
    for(lint i=1; i*i<=X+Y; i++) {
      if((X+Y)%(i+1) == 0) {
        div.push_back(i);
        if((X+Y)/(i+1) != i) div.push_back((X+Y)/(i+1)-1);
      }
    }
    lint ans = 0;
    REP(i, div.size()) {
      if(div[i] == 1) {
        if(X == Y) ans += X-1;
      } else if(abs(X-Y)%(div[i]-1) == 0){
        lint BpC = (X+Y)/(div[i]+1);
        lint BmC = (X-Y)/(div[i]-1);
        if(BpC+BmC > 0 && (BpC+BmC)%2 == 0 && BpC-BmC > 0 && (BpC-BmC)%2 == 0) {
          //cout << div[i] << "\n";
          ans++;
        }
      }
    }
    cout << ans << "\n";
  }
}