#include <bits/stdc++.h>
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
  std::chrono::time_point<std::chrono::system_clock> end;
  end = std::chrono::system_clock::now();
  std::chrono::duration<double> elapsed_seconds = end - start;
  std::time_t end_time = std::chrono::system_clock::to_time_t(end);
  cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
inline long long binexp(long long a, long long b, long long m) {
  if (a == 0) {
    return 0;
  }
  long long res = 1;
  a %= m;
  while (b) {
    if (b & 1) res = (res * 1ll * a) % m;
    a = (a * 1ll * a) % m;
    b >>= 1;
  }
  return res;
}
inline long long binmul(long long a, long long b, long long m) {
  a %= m;
  long long res = 0;
  while (b) {
    if (b & 1) {
      res = (res + a) % m;
    }
    a = (a + a) % m;
    b >>= 1;
  }
  return res;
}
long long dp[32][2][2][2];
long long l, r;
inline long long solve(long long n, long long f, long long f1, long long f2) {
  if (n == -1) return 1;
  if (dp[n][f][f1][f2] != -1) return dp[n][f][f1][f2];
  long long ans = 0;
  for (long long i = 0; i < 2; i++) {
    for (long long j = 0; j < 2; j++) {
      if (f1 == 0 && (r & (1ll << n)) == 0 && i == 1) {
        continue;
      }
      if ((f == 0 && i < j) || (i & j)) continue;
      if (f2 == 0 && (l & (1ll << n)) != 0 && j == 0) continue;
      ans += solve(n - 1, f | (i > j), f1 | ((r & (1ll << n)) != 0 && i == 0),
                   f2 | ((l & (1ll << n)) == 0 && j == 1));
    }
  }
  return dp[n][f][f1][f2] = ans;
}
inline void solve_me_senpai() {
  cin >> l >> r;
  memset(dp, -1, sizeof(dp));
  long long ans = 2 * solve(31, 0, 0, 0);
  if (l == 0 and r == 0)
    ans = 1;
  else if (l == 0)
    ans--;
  cout << ans;
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  long long a = 1;
  while (t--) {
    solve_me_senpai();
    a++;
  }
  return 0;
}
