#include <iostream>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
map<pair<ll, ll>, int> vis;
long long gcd(long long a, long long b)
{
    if (b == 0)
    {
        return a;
    }
    return gcd(b, a % b);
}
ll ans = 1e15;
void bfs(ll k1, ll k2)
{
    priority_queue<pair<ll, pair<ll, ll>>,vector<pair<ll, pair<ll, ll>>>,greater<pair<ll, pair<ll, ll>>>> q;
    q.push({ 0, {k1, k2} });
    vis[{k1, k2}] = 1;
    while (q.size())
    {
        auto [cnt, p] = q.top();
        q.pop();
        ll a = p.first;
        ll b = p.second;
        ans = min(ans, min(a, b) + 1 + cnt);
        if (a == 1 || b == 1)
        {
            ans = min(ans, cnt + 2);
            return;
        }
        ll cost = 0;
        for (int i = 2; i <= min(a, b); i++) {
            cost = 0;
            ll cpa = a, cpb = b;
            cost += cpa % i;
            cpa -= cpa % i;
            cost += cpb % i;
            cpb -= cpb % i;
            cpa /= i, cpb /= i;
            if (vis[{cpa, cpb}] > cnt + cost || vis[{cpa, cpb}] == 0) {
                vis[{cpa, cpb}] = cnt + cost;
                q.push({ cnt + cost,{cpa,cpb} });
            }
        }
    }
}
int main()
{
    int t;
    cin >> t;
    int T = 0;
    while (t--)
    {
        T++;
        long long a, b;
        cin >> a >> b;
        vis.clear();
        if (T == 342)
        {
            cout << a << "asasas" << b << endl;
        }
        ll cnt = 0;
        ll k1 = a / gcd(a, b);
        ll k2 = b / gcd(a, b);
        ans = 1e15;
        bfs(k1, k2);
        cout << ans << '\n';
    }
    return 0;
}