#include <bits/stdc++.h>

using namespace std;

#define int long long

const int inf = 1e18;

using vi = vector<int>;

unordered_map<int, int> g;

int f(int x) {
    if (g[x] != 0) return g[x];
    if (x % 3 == 0) return g[x] = f(x / 3) + 1;
    else return g[x] = f(x - x % 3) + x % 3;
}

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

    vector<int> a;
    for (int x = r; x; x /= 3) a.push_back(x % 3);
    std::reverse(a.begin(), a.end());
    int res = a.size() + accumulate(a.begin(), a.end(), 0ll);
    vector<int> b;
    for (int x = l; x; x /= 3) b.push_back(x % 3);
    std::reverse(b.begin(), b.end());
    if (a.size() != b.size()) {
        res = max(res, ((int) a.size() - 1ll) * 3ll);
    } else {
        for (int i = 0; i < a.size(); i++) {
            if (a[i] == b[i]) continue;
            a[i]--;
            for (int j = i + 1; j < a.size(); j++)
                a[j] = 2;
        }
        res = max(res, accumulate(a.begin(), a.end(), 0ll));
    }
    cout << res << "\n";
    return ;
}


int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int t;
    g[0] = 1;
    for (cin >> t; t; t--)
        solve();

    return 0;
}