#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

vector<int> factorize(int x) {
    vector<int> ret;
    for (int i = 2; i * i <= x; i++) {
        if (x % i == 0) {
            ret.push_back(i);
            while (x % i == 0) {
                x /= i;
            }
        }
    }
    if (x != 1) {
        ret.push_back(x);
    }
    return ret;
} 

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

	if (d < a) {
		swap(a, d);
	}	
	d -= a;

	map<pair<int, int>, int> mp;
	vector<int> P = factorize(d);
	auto dfs = [&] (auto self, int x, int y) -> int {
		if (mp.count({x, y})) {
			return mp[{x, y}];
		}
        // cerr << x << " " << y << "\n";
		if (x == 1) {
			return 0;
		}
		int ret = 1e18;
		for (int i = 0; i < P.size(); i++) {
			int p = P[i];
			if (y % p != 0) {
				continue;
			}
			int l = x % p;
			ret = min(ret, self(self, (x - l) / p, y / p) + l + 1);
			ret = min(ret, self(self, (x - l + p) / p, y / p) + p - l + 1);
		}
		if (ret == 1e18) {
			ret = x - 1;
		}
		mp[{x, y}] = ret;
		return ret;
	};

	cout << dfs(dfs, a, d) << "\n";
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}