#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
LL pw[50];
int main() {
    //file("");
    pw[0] = 1; int id = -1;
    for(int i = 1; i <= 50; i++) {
        pw[i] = pw[i - 1] * 3;
        if(pw[i] >= (LL)(1e18)) {
            id = i;
            break;
        }
    }
    int n; read(n);
    for(int i = 1; i <= n; i++) {
        LL l, r; read(l), read(r);
        int res = 0, ans = 0, flag = 0;
        for(int j = id; j >= 0; j--) {
            if(!flag)
            if(!((r / pw[j]) % 3)) {
                continue;
            }
            flag = 1;
            if((r / pw[j]) % 3 != (l / pw[j]) % 3) {
                ans = max(ans, int(res + ((r / pw[j]) % 3 - 1) + 1 + 3 * (j - 1)));
                l=r/pw[j]*pw[j];
            }
            res += 1 + (r / pw[j]) % 3;
        }
        ans = max(ans, res);
        cout << ans << '\n';
    }
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}