#include <bits/stdc++.h>
#define maxn 1000007
#define int long long
#define dl long double
#define mod 1000000007
using namespace std;
int n, m;
inline int pls(int a, int b) {int m = a + b; return m < mod ? m : m - mod;}
inline int dec(int a, int b) {int m = a - b; return m < 0 ? m + mod : m;}
inline int mul(int a, int b) {return 1ll * a * b % mod;}
inline int fpow(int a, int b) {
  int ans = 1;
  for(; b; b >>= 1,a = mul(a, a)) if(b & 1) ans = mul(ans, a);
  return ans;
}
inline int inv(int a) {return fpow(a, mod - 2);}
inline int dvi(int a, int b) {return mul(a, inv(b));};
inline int qread() {
  char c = getchar(); int num = 0, f = 1;
  for(; !isdigit(c); c=getchar()) if(c == '-') f = -1;
  for(; isdigit(c); c=getchar()) num = num * 10 + c - '0';
  return num * f;
}
const int base = 50; 
int ma[100], mi[100], t;
int dfs(int u, int isl, int isr, int isz) {
  if(u > base) return 0;
  if(!isl && !isr) {
    //cout << u << ' ' << isl << ' ' << isr << ' ' << isz << ' ' << (base - u + 1) * 2 << '\n';
    return (base - u + 1) * 2 + (base - u + 1);
  }
  int l = (isl) ? mi[u] : 0;
  int r = (isr) ? ma[u] : 2;
  int res = 0;
  for(int i = l; i <= r; ++i) {
    res = max(res, (isz || i) + i + dfs(u + 1, isl && i == mi[u], isr && i == ma[u], isz || i != 0));
  }
  //cout << u << ' ' << isl << ' ' << isr << ' ' << isz << ' ' << res << '\n';
  return res;
}
void solve() {
  memset(ma, 0, sizeof(ma));
  memset(mi, 0, sizeof(mi));
  int l = qread(), r = qread();
  for(int i = 1; l; i++) {
    mi[i] = l % 3; l /= 3;
  }
  for(int i = 1; r; i++) {
    ma[i] = r % 3; r /= 3;
  }
  reverse(mi + 1, mi + 1 + base);
  reverse(ma + 1, ma + 1 + base);
  cout << dfs(1, 1, 1, 0) << '\n';
}
signed main() {
  t = qread();
  while(t--) {
    solve();
  }
  return 0;
}