#include <bits/stdc++.h>

using namespace std;

#define MOD 1000000007

int solve(int x, int y) {
  int b = 30;
  while ((y & (1 << b)) == 0) {
    b--;
  }

  long long ret = 0;
  long long last = y;
  for (int i = b; (1 << i) >= x; i--) {
    long long lim = (1 << i);
    long long sz = last - lim + 1;
    ret = (ret + sz * (sz + 1) / 2) % MOD;
    last = (1 << i) - 1;
  }
  long long sz = last - x + 1;
  ret = (ret + sz * (sz + 1) / 2) % MOD;
  
  return ret;
}

int main() {
	// assert(freopen("andint.in", "r", stdin));
	// assert(freopen("andint.out", "w", stdout));
	cin.sync_with_stdio(false);

  int Q, x, y;
	
  cin >> Q;
  while (Q-- > 0) {
    cin >> x >> y;

    int ans = solve(x, y);
    cout << ans << endl;
  }

	return 0;
}