// Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;

// Main
ll solve_sub(ll x, ll y, ll a) {
    if (a == 0) return 0;
    if (a == 1) {
        if (x == y) return x + y - 1; else return 0;
    }
    if ((a * y - x) % (a * a - 1)) return false;
    ll c = (a * y - x) / (a * a - 1);
    ll b = y - a * c;
    return b > 0 && c > 0;
}

void solve() {
    int x, y;
    cin >> x >> y;
    
    ll ans = 0;
    for (int i = 1; i * i <= (x + y); ++i) {
        if ((x + y) % i) continue;
        ans += solve_sub(x, y, i - 1);
        if ((x + y) / i != i) ans += solve_sub(x, y, (x + y) / i - 1);
    }
    if (x == y) ans += (x + y - 1);
    cout << ans << "\n";
}

int main() {
    int s;
    cin >> s;
    while (s--) solve();
    return 0;
}