#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

long long query(long long a, long long b) {
  long long p = 1;
  long long ans = 0;
  while(p <= b) {
    p *= 2;
  }
  p /= 2;
  while(b >= a) {
    long long l = b - max(p, a) + 1;
    ans += l * (l + 1) / 2;
    b = p - 1;
    p /= 2;
  }

  return ans;
}

int main()
{
  int q;
  for(cin >> q; q; q--) {
    int a, b;
    cin >> a >> b;
    cout << query(a, b) << '\n';
  }

  return 0;
}