#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) (x).begin(), (x).end()

const int M = 5050;
const ll inf = 1e18;

map<ll, ll> mem[M];

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

ll rec(ll a, ll b) {
//  cerr << a << " " << b << "\n";
  if (mem[a].contains(b))
    return mem[a][b];

  if (a == 0 && b == 0)
    return 0;

  ll g = gcd(a, b);
  a /= g, b /= g;

  if (a == 0 || b == 0)
    return 1;

  if (a == 1)
    return 2;

  ll k = 0;
  while ((g = gcd(a, b - k)) == 1)
    ++k;

  return mem[a][b] = min(rec(a - 1, b) + 1, rec(a / g, (b - k) / g) + k);
}

int main() {
#ifndef ONLINE_JUDGE
  freopen("g.txt", "r", stdin);
#endif
  ios_base::sync_with_stdio(false);

  int t;
  cin >> t;
  while (t--) {
    ll a, b;
    cin >> a >> b;
    cout << rec(a, b) << "\n";
  }

  return 0;
}