#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define yn {puts("Yes");}else{puts("No");}
template<typename T> int lwb(const vector<T>& a, const T& x) { return lower_bound(rng(a), x) - a.begin();}
template<typename T> int upb(const vector<T>& a, const T& x) { return upper_bound(rng(a), x) - a.begin();}
template<typename T> bool exists(const vector<T>& a, const T& x) { return binary_search(rng(a), x);}

// ull -> Val (maspy orz)
template <typename Val>
struct HashMap {
  HashMap(uint n = 0) { build(n);}
  void build(uint n) {
    uint k = 8; while (k < n*2) k *= 2;
    cap = k/2; mask = k-1; key.resize(k); val.resize(k); used.assign(k,0);
  }
  void clear() { used.assign(sz(used),0);} // keep size
  int size() { return sz(used)/2 - cap;}
  int index(const ull& k) {
    int i = hash(k); while (used[i] && key[i] != k) i = (i+1)&mask;
    return i;
  }
  Val& operator[](const ull& k) {
    if (cap == 0) extend();
    int i = index(k);
    if (!used[i]) used[i] = 1, key[i] = k, val[i] = Val{}, --cap;
    return val[i];
  }
  Val get(const ull& k, Val default_value=Val{}) {
    int i = index(k); return (used[i] ? val[i] : default_value);
  }
  bool count(const ull& k) { return used[index(k)];}
  template <class F> void each(F f) { rep(i,sz(used)) if (used[i]) f(key[i],val[i]);}
private:
  uint cap, mask; vc<ull> key; vc<Val> val; vc<bool> used;
  ull hash(ull x) {
    static const ull FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
    x += FIXED_RANDOM;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return (x ^ (x >> 31)) & mask;
  }
  void extend() {
    vc<pair<ull,Val>> dat; dat.reserve(size());
    rep(i,sz(used)) if (used[i]) dat.eb(key[i],val[i]);
    build(2*sz(dat)); for (auto& [a,b] : dat) (*this)[a] = b;
  }
};

struct Solver {
  void solve() {
    int a; ll B;
    cin>>a>>B;

    vc<HashMap<int>> dist(a+1);
    queue<pair<int,ull>> q;
    auto push = [&](int a, ull b, int d) {
      if (dist[a].count(b)) return;
      dist[a][b] = d; q.em(a,b);
    };
    push(a,B,0);
    while (sz(q) && !dist[0].count(0)) {
      auto [a,b] = q.front(); q.pop();
      int d = dist[a][b];
      int g = gcd(a,b);
      if (a) push(a-g,b,d+1);
      if (b) push(a,b-g,d+1);
    }
    ll ans = dist[0][0];

    // vvi ds(a+1);
    // rep1(i,a) {
    //   for (int j = i; j <= a; j += i) ds[j].pb(i);
    // }

    // auto get = [&](int g) {
    //   return B/g*g;
    // };
    // auto fj = [&](int i, int g) {
    //   return lwb(ds[i],g);
    // };

    // vvl nxt(a+1);
    // rep1(i,a) {
    //   nxt[i] = vl(sz(ds[i]));
    //   rep(j,sz(ds[i])) {
    //     int g = ds[i][j];
    //     ll b = get(g);
    //     if (gcd(b,i) != g) continue;
    //     for (int ng : ds[g]) {
    //       if (g == ng) continue;
    //       int nj = fj(i,ng);
    //       maxs(nxt[i][nj], b);
    //     }
    //   }
    // }

    // vvl dp(a+1);
    // rep1(i,a) dp[i] = vl(sz(ds[i]),LINF);
    // dp[a][fj(a,gcd(a,B))] = 0;
    // ll ans = LINF;
    // for (int i = a; i > 0; i--) {
    //   rep(j,sz(ds[i])) {
    //     ll now = dp[i][j];
    //     if (now == LINF) continue;
    //     int g = ds[i][j];
    //     ll b = get(g);

    //     if (g != i) {
    //       ll nb = nxt[i][j];
    //       int ng = gcd(i,nb);
    //       int nj = fj(i,ng);
    //       ll cost = (b-nb)/g;
    //       cerr<<i<<" "<<g<<" "<<b<<": "<<nb<<" "<<ng<<endl;
    //       maxs(dp[i][nj], now+cost);
    //     }

    //     if (b == 0) mins(ans,now+1);
    //     else if (i == g) mins(ans,now+2);
    //     else {
    //       int ni = i-g;
    //       int nj = fj(ni,gcd(ni,b));
    //       mins(dp[ni][nj], now+1);
    //     }
    //   }
    // }
    cout<<ans<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}