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

const int MAXN = 1010;

inline long long read() {
	long long x = 0, f = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
}

long long l, r;
long long a[MAXN], b[MAXN], len1, len2;

int main() {
	long long t; t = read();
	while (t--) {
		l = read(); r = read();
		len1 = -1; len2 = -1;
		while (l) {
			len1++;
			a[len1] = l % 3;
			l /= 3;
		}
		while (r) {
			len2++;
			b[len2] = r % 3;
			r /= 3;
		}
		if (len1 != len2) {
			long long ans = 3 * len2;
			long long cnt = len2 + 1;
			for (int i = len2; i >= 0; i--) a[i] = (i == len2) ? 1 : 0;
			for (int i = len2; i >= 0; i--) {
				cnt += b[i];
				if (a[i] != b[i]) ans = max(ans, cnt - 1 + 2 * i);
			}	
			printf("%lld\n", max(ans, cnt));
		} else {
			long long ans = 0, cnt = len2 + 1;
			for (int i = len2; i >= 0; i--) {
				cnt += b[i];
				if (a[i] != b[i]) {
					ans = max(ans, cnt - 1 + 2 * i);
					for (int j = i - 1; j >= 0; j--)
						b[j] = 0;
				}
			}
			printf("%lld\n", max(ans, cnt));
		}
	}	
	return 0;
}