#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int mod = 998244353;
const ll inf = 1e18;

vector<ll> p(50);
void init() {
  p[0] = 1;
  for (int i = 1; p[i - 1] * 3 <= inf; i++) p[i] = p[i - 1] * 3;
}

void solve() {
  ll l, r;
  cin >> l >> r;

  // vector<int> f(r + 1);
  // f[0] = 1;
  // int mx = 0;
  // for (int x = 1; x <= r; x++) {
  //   if (x % 3 == 0)
  //     f[x] = f[x / 3] + 1;
  //   else
  //     f[x] = f[x - 1] + 1;
  // }
  // for (int x = l; x <= r; x++)
  //   mx = max(mx, f[x]);
  // cerr << mx << "\n";

  ll ans = 0, cur = 37;
  while (p[cur] > r) cur--;
  ll y = r;
  while (y > 0) {
    ans += y % 3 + 1;
    y /= 3;
  }
  // cerr << ans << "\n";

  if ((r / p[cur]) % 3 > (l / p[cur]) % 3) {
    ans = max(ans, 3 * cur + 2 * ((r / p[cur]) % 3 != 1));
  }
  // cerr << ans << "\n";

  int pre = (r / p[cur]) % 3 + 1, ok = (r / p[cur]) % 3 > (l / p[cur]) % 3;
  cur--;
  while (cur > 0) {
    pre += (r / p[cur]) % 3 + 1;
    if ((r / p[cur]) % 3 == (l / p[cur]) % 3 &&
        !(ok && (r / p[cur]) % 3 == 0)) {
      cur--;
      continue;
    }
    ans = max(ans, pre - 1 + 3 * cur);
    break;
  }
  cout << ans << "\n";
}

signed main() {
  init();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}