#include <bits/stdc++.h>


using namespace std;


#define lll __int128_t
#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


mt19937 rnd(234);
const lll inf = 3e18;


ll gcd(ll a, ll b){
    while(a != 0){
        b %= a;
        swap(a, b);
    }
    return b;
}


struct bebra{
    lll x, y;

    bebra(){}
    bebra(lll x, lll y) : x(x), y(y) {}
};


bool operator<(const bebra &a, const bebra &b){
    return a.x * b.y < a.y * b.x;
}

bool operator<=(const bebra &a, const bebra &b){
    return a.x * b.y <= a.y * b.x;
}


bebra min(const bebra &a, const bebra &b){
    if(a < b){
        return a;
    }
    return b;
}


bebra max(const bebra &a, const bebra &b){
    if(a < b){
        return b;
    }
    return a;
}


ll solve_slow(ll a, ll b){
    ll rs = 0;

    bebra l(0, 1);
    bebra r(inf, 1);
    bebra opt(a, b);
    bebra t(0, 0);
    while(t.x < opt.x || t.y < opt.y){
        if(t <= opt){
            l = max(l, t);
            t.x += 1;
            auto f = t;
            f.x += max(0ll, (a / b) - 10);
            if(f <= opt && !(l <= f && f < r)){
                t = f;
            }
        } else{
            r = min(r, t);
            t.y += 1;
            auto f = t;
            f.y += max(0ll, (b / a) - 10);
            if(opt < f && !(l <= f && f < r)){
                t = f;
            }
        }
        if(l <= t && t < r){
            rs += 1;
        }
    }
    return rs;
}


int32_t main(){
    if(1){
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int t;
    cin >> t;
    while(t--){
        ll a, b;
        cin >> a >> b;
        cout << solve_slow(a, b) << "\n";
    }
    return 0;
}

/*
5
8 20
8 20

*/