#include <cstdio>
#include <cstring>
using namespace std;

typedef long long ll;
int T,ans,cnt,a[99],b[99]; ll l,r,pow[99];

int max(int x,int y) { return x > y ? x : y; }

void read(int &x)
{
	char c = getchar(); x = 0;
	while(c < '0' || c > '9') c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
}

int count(ll x)
{
	int rest = 0;
	for(;x;x /= 3) rest += x % 3 + 1;
	return rest;
}

void check(ll x) { if(x >= l && x <= r) ans = max(ans,count(x)); }

void dfs(int now,ll x)
{
	if(now == 0) { check(x); return; }
	for(int i = 0;i <= a[now]; ++ i)
		if(i < a[now]) check(x + (i + 1) * pow[now] - 1);
		else dfs(now - 1,x + i * pow[now]);
}

int main()
{
	pow[0] = 1;
	for(int i = 1;i <= 50; ++ i) pow[i] = pow[i - 1] * 3;
	
	for(scanf("%d",&T);T--;)
	{
		scanf("%lld%lld",&l,&r);
		ans = count(r);
		if(r - 1 >= l) ans = max(ans,count(r - 1));
		if(r - 2 >= l) ans = max(ans,count(r - 2));
		
		for(cnt = 0;pow[cnt] <= r; ++cnt);
		--cnt;
		
		for(int i = cnt;i >= 0; -- i)
			a[i] = r / pow[i], r -= pow[i] * a[i];
		dfs(cnt,0ll), printf("%d\n",ans);
	}
	
	return 0;
}