#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef pair<ll, ll> P;
#define x first
#define y second
#define int long long

const int mod = 1e9 + 7;
const int pp = 998244353;

const int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int ddx[8] = {1, 1, 2, 2, -1, -1, -2, -2}, ddy[8] = {2, -2, 1, -1, 2, -2, 1, -1};

ll ksm(ll a, ll b, ll p) {
    ll ans = 1;
    a %= p;
    while(b) {
        if(b & 1) ans = (ans * a) % p;
        b >>= 1;
        a = (a * a) % p;
    }
    return ans % p;
}

std::mt19937 rng;  // 随机数生成器  
int rand(int l, int r) {
    std::uniform_int_distribution<int> distribution(l, r);
    return distribution(rng);
}



void solve() {
    int a, b;
    cin >> a >> b;

    map<P, int> mp;
    auto dfs = [&](auto && self, int x, int y, int dep) -> int {
        if(dep > 35) return 100;
        if(x == 0 && y == 0) return 0;
        if(x == 0 || y == 0) {
            return 1;
        }
        if(x % y == 0 || y % x == 0) {
            return mp[{x, y}] = 2;
        }
        // cerr << "x : " << x << ", y : " << y << endl;
        int g = __gcd(x, y);
        x /= g;
        y /= g;
        if(mp.count({x, y})) return mp[{x, y}];
        int mn = 1e9;
        mn = min(mn, self(self, x - 1, y, dep + 1) + 1);
        mn = min(mn, self(self, x, y - 1, dep + 1) + 1);
        return mp[{x, y}] = mn;
    };

    cout << dfs(dfs, a, b, 0) << endl;
}

/*



*/

signed main () {
    // init(minp, primes, m); // primes
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    // init();
    int _ = 1;
    cin >> _;
    while(_ -- ) {
        solve();
    }
    return 0;
}