#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <stack>

#ifdef LOCAL
template <class T, size_t size = std::tuple_size<T>::value> std::string to_debug(T, std::string s = "") requires(not std::ranges::range<T>);
std::string to_debug(auto x) requires requires(std::ostream& os) { os << x; } { return static_cast<std::ostringstream>(std::ostringstream() << x).str(); }
std::string to_debug(std::ranges::range auto x, std::string s = "") requires(not std::is_same_v<decltype(x), std::string>) {
  for (auto xi : x) { s += ", " + to_debug(xi); }
  return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size> std::string to_debug(T x, std::string s) requires(not std::ranges::range<T>) {
  [&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
  return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}
#define debug(...) std::cerr << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"
#else
#define debug(x...)
#endif

using i64 = long long;

int n;

int f(i64 x)
{
    int res{};
    if (x == 0) {res = 1;}
    else if (x % 3 == 0) {res = f(x / 3) + 1;}
    else {res = f(x - 1) + 1;}
    return res;
}

void solve()
{
#define tests
    i64 l; i64 r; std::cin >> l >> r;
    std::vector<short> digits; auto x{r}; while (x) {digits.push_back(x % 3); x /= 3;} std::ranges::reverse(digits); 
    int n{(int)(std::size(digits))}; int ans{}; for (int i = 0; i < n; i++) {
        i64 now{};
        for (int j = 0; j < i; j++) {now *= 3; now += digits.at(j);}
        for (int j = i; j < n; j++) {now *= 3; now += 2;} 
        if (now >= l and now <= r) {ans = std::max(ans, f(now));}
    }
    ans = std::max({ans, f(l), f(r)});

    std::cout << ans << "\n";
}

signed main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int _{1};
#ifdef tests
    std::cin >> _;
#endif
    while(_--) {solve();}
    return 0;
}