#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;

void solve() {
	int l,r; cin >> l >> r;
	int b1[64] = {0};
	int b2[64] = {0};
	int lb1 = 0, lb2 = 0;

	do {
		b1[++ lb1] = l % 3;
		l /= 3;
	} while (l);

	int ans = 0;
	do {
		ans += r%3 + 1;
		b2[++ lb2] = r % 3;
		r /= 3;
	} while (r);
	ans = max(ans, lb2);

	if (lb1 != lb2) {
		ans = max(ans, (lb1-1) * 3);
		lb1 = lb2;
		for (int i=1;i<lb1;i++) b1[i] = 0;
		b1[lb1] = 1;
	}
	int sum = lb2;
	for (int i=lb2;i>=1;i--) {
		if (b1[i] < b2[i]) {
			ans = max(ans, sum + (b2[i]-1) + (i-1)*2);
			break;
		}
		sum += b2[i];
	}
	println(ans);
}
signed main() {
	fastIO();
	int _ = 1; cin >> _;
	while (_--) {
		solve();
	}
	
	return 0;
}