#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

const int N = 5e3 + 5;
int G[N][N];

vi divs[N];
void precalc() {
    rep(a, N) {
        rep(b, N) {
            G[a][b] = gcd(a, b);
        }
    }
    for(int a = 2; a < N; ++a) {
        for(int b = a; b < N; b += a) divs[b].push_back(a);
    }
}


void solve() {
    ll A, B; cin >> A >> B;
    {
        ll g = gcd(A, B);
        A /= g;
        B /= g;
    }

    vector<vector<ll>> dp(A + 1, vector<ll>(A + 1, INF));
    dp[A][1] = 0;

    for(ll a = A; a >= 1; --a) {
        for(ll d = 1; d * a <= A; ++d) {
            ll v = dp[a][d];

            if (v == INF) continue;

            ll b = B / d;
            ll g = G[a][b % a];
            if (g != 1) {
                ckmin(dp[a/g][d*g], v);
                continue;
            }

            ckmin(dp[a-1][d], v + 1);

            pair<ll, int> who = {INF, -1};
            for(int d2 : divs[a]) {
                ckmin(who, {b % d2, d2});
            }

            if (who.second != -1) {
                ckmin(dp[a / who.second][d * who.second], v + who.first);
            }
        }
    }

    ll ans = INF;
    rep(i, A + 1) ckmin(ans, dp[0][i] + 1);
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    precalc();
    int t = 1;
    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}