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

int T,n,m;

map <int, int> F;

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


int solve(int l, int r)
{
	if(l == r)
		return f(l);

	int re = 0;
	for(int i = min(1LL, l); i <= max(2LL, r); i++)
		re = max(re, f(i));

	if(r % 3 == 2)
	{
		int nl = max(3LL, l / 3), nr = r / 3;
		if(nl <= nr)
			re = max(re, solve(nl, nr) + 3);
	}
	else
	{
		int nl = max(3LL, l / 3), nr = (r - (r % 3)) / 3;
		if(nl <= nr)
			re = max(re, solve(nl, nr) + 3);				
		re = max({re, f(r)});
	}

	return re;

}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>T;

	while(T--)
	{
		int l, r;
		cin >> l >> r;

		cout << solve(l, r) << '\n';
	}

	return 0;
}