#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
    int X, Y;
    cin >> X >> Y;
    if (X == Y) {
        ll ans = X - 1;
        ll t = 2;
        while (t * t <= X) {
            if (X % t == 0) {
                if (t * t == X) {
                    ans++;
                } else {
                    ans += 2;
                }
            }
            t++;
        }
        if (X > 1) {
            ans += 1;
        }
        cout << ans << "\n";
        return;
    }
    if (X < Y) {
        swap(X, Y);
    }

    int PN = X + Y;

    int ans = 0;

    int MN = X - Y;
    int t = 1;
    while (t * t <= MN) {
        if (MN % t == 0) {
            int n = MN / t;
            if (PN % (t + 2) == 0) {
                int target = PN / (t + 2);
                if ((target + n) % 2 == 0 && target > n) {
                    ans++;
                }
            }

            if (n != t && PN % (n + 2) == 0) {
                int target = PN / (n + 2);
                if ((target + t) % 2 == 0 && target > t) {
                    ans++;
                }
            }
        }
        t++;
    }

    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int S;
    cin >> S;
    for (int i = 0; i < S; i++) {
        solve();
    }

    return 0;
}