#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
vector<long long> v;
vector<long long> w;
long long dp[35][2][2][2];
long long calc(long long i, long long f1, long long f2, long long f3) {
  if (i < 0) {
    return 1;
  }
  if (dp[i][f1][f2][f3] != -1) {
    return dp[i][f1][f2][f3];
  }
  long long x;
  if (f1 && f2) {
    if (f3) {
      x = 3 * calc(i - 1, f1, f2, f3);
    } else {
      x = calc(i - 1, f1, f2, 1) + calc(i - 1, f1, f2, f3);
    }
  } else if (f1) {
    if (v[i] == 0) {
      if (f3) {
        x = 2 * calc(i - 1, f1, f2, f3) + calc(i - 1, f1, 1, f3);
      } else {
        x = calc(i - 1, f1, f2, f3) + calc(i - 1, f1, f2, 1);
      }
    } else {
      if (f3) {
        x = calc(i - 1, f1, f2, f3);
      } else {
        x = 0;
      }
    }
  } else if (f2) {
    if (w[i] == 0) {
      if (f3) {
        x = 2 * calc(i - 1, f1, f2, f3);
      } else {
        x = 0;
      }
    } else {
      if (f3) {
        x = 2 * calc(i - 1, 1, f2, f3) + calc(i - 1, f1, f2, f3);
      } else {
        x = calc(i - 1, 1, f2, f3) + calc(i - 1, f1, f2, 1);
      }
    }
  } else {
    if (w[i] == 1 && v[i] == 1) {
      if (f3) {
        x = calc(i - 1, 1, f2, f3);
      } else {
        x = 0;
      }
    } else if (w[i] == 1 && v[i] == 0) {
      if (f3) {
        x = calc(i - 1, f1, f2, f3) + calc(i - 1, 1, f2, f3) +
            calc(i - 1, 1, 1, f3);
      } else {
        x = calc(i - 1, f1, f2, 1) + calc(i - 1, 1, f2, f3);
      }
    } else if (w[i] == 0 && v[i] == 1) {
      if (f3) {
        x = calc(i - 1, f1, f2, f3);
      } else {
        x = 0;
      }
    } else {
      if (f3) {
        x = calc(i - 1, f1, f2, f3) + calc(i - 1, f1, 1, f3);
      } else {
        x = calc(i - 1, f1, f2, f3);
      }
    }
  }
  dp[i][f1][f2][f3] = x;
  return x;
}
void ini() {
  for (int i = 0; i < 35; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 2; k++) {
        for (int l = 0; l < 2; l++) {
          dp[i][j][k][l] = -1;
        }
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, h, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  unordered_map<long long, long long> N;
  set<long long> S;
  set<long long>::iterator itr;
  long long po[35];
  po[0] = 1;
  for (i = 1; i < 35; i++) {
    po[i] = po[i - 1] * 2;
  }
  cin >> t;
  while (t--) {
    ini();
    v.clear();
    w.clear();
    cin >> l >> r;
    if (l == 0 && r == 0) {
      cout << "1\n";
      continue;
    }
    p = l;
    for (i = 0; i < 35; i++) {
      v.push_back(p % 2);
      p /= 2;
    }
    p = r;
    for (i = 0; i < 35; i++) {
      w.push_back(p % 2);
      p /= 2;
    }
    if (l == 0) {
      v[0] = 1;
      x = r;
      x += calc(34, 0, 0, 0);
      x = x * 2;
      x++;
      cout << x << "\n";
    } else {
      x = calc(34, 0, 0, 0);
      x = x * 2;
      cout << x << "\n";
    }
  }
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
