#include <bits/stdc++.h>

using namespace std;

const int N = 5e4 + 5, P = 1e9 + 7;

void add(int &x, int y) {
    ((x += y) >= P) && (x -= P);
}

int f[61][3][2][2];

int calc(long long v, long long n) {
    if (n < 0) return 0;
    memset(f, 0, sizeof(f));
    f[0][0][0][0] = 1;
    for (int i = 0; i < 60; ++i) {
        for (int j = 0; j <= 2; ++j) {
            for (int k = 0; k < 2; ++k) {
                for (int l = 0; l < 2; ++l) {
                    if (!f[i][j][k][l]) continue;
                    for (int a = 0; a < 2; ++a) {
                        for (int b = 0; b < 2; ++b) {
                            for (int c = 0; c < 2; ++c) {
                                int t = j + a + b + c;
                                if ((a ^ (t & 1) ^ c) != ((v >> i) & 1)) continue;
                                add(f[i + 1][t >> 1][k | b][((t & 1) == ((n >> i) & 1)) ? l : ((t & 1) > ((n >> i) & 1))], f[i][j][k][l]);
                            }
                        }
                    }
                }
            }
        }
    }
    return f[60][0][1][0];
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        long long n, m; scanf("%lld%lld", &n, &m);
        long long v = (n % 4 == 3 ? 0 : (n % 4 == 0 ? n : (n % 4 == 1 ? 1 : n + 1))) ^ m;
        printf("%lld\n", (0ll + calc(v, n) + calc(v, m) - calc(v, m - 1) + P) % P);
    }
    return 0;
}