#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  long long a, b;
  cin >> a >> b;
  if (a == b) cout << "0\n";
  else {
    int cnt = 0;
    while (a * 2 < b) a = a * 2, cnt += 1;
    int res = cnt;
    int d = b - a;
    while (d) {
      res += d / (1 << cnt);
      d %= (1 << cnt);
      cnt -= 1;
    }
    cout << res << "\n";
  }
  
  
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}