#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define fi first
#define se second
#define all(a) a.begin(), a.end()

#define N 5050

string b_string(ll x, int b=3) {
    string res = "";
    while (x) res += '0'+x%b, x /= b;
    reverse(all(res));
    return res;
}

void pad(string& a, string& b) {
    a = string(max(a.length(), b.length()) - a.length(), '0') + a;
    b = string(max(a.length(), b.length()) - b.length(), '0') + b;
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int l, r; cin >> l >> r;
        string ls = b_string(l), rs = b_string(r);
        pad(ls, rs);
        int res = 0;
        for (int i = 0; i < rs.length(); ++ i) res += rs[i] - '0' + 1;

        for (int i = 0; i < ls.length(); ++ i) {
            if (ls[i] == rs[i]) continue;
            rs[i] -= 1;
            for (int j = i+1; j < rs.length(); ++ j) rs[j] = '2';
            break;
        }
        int cur = 0;
        for (int i = 0, f = 0; i < rs.length(); ++ i) {
            if (!f && rs[i] == '0') continue;
            f = 1;
            cur += rs[i] - '0' + 1;
        }
        cout << max(res, cur) << '\n';
    }
}