#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
    return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
    return a > b && (a = b, true);
}
/*-------------------------------------------*/

vector<ll> vec;

vector<ll> p(ll x) {
    vector<ll> res;
    for(ll i = 1; i * i <= x; i++) {
        if(x % i == 0) {
            res.push_back(i);
            if(i * i < x) res.push_back(x / i);
        }
    }
    return res;
}

ll solve(ll x, ll y) {
    if(x > y) swap(x, y);

    vec = p(y - x);
    ll ans = 0;
    for(auto i : vec)
        if((y + x) % (i + 2) == 0) {
            ll a = ((y + x) / (i + 2) - (y - x) / i);
            if(a > 0 && a % 2 == 0) ans++;
        }
    return ans;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int t;
    cin >> t;
    while(t--) {
        ll x, y;
        cin >> x >> y;
        cout << solve(x, y) << "\n";
    }

    return 0;
}