//
// Created by Luhao Yan on 2023/11/26.
//
#include <bits/stdc++.h>

using ll = long long;
const ll mod = 1e9 + 7;

int f[64][4][2][2];

ll pre(ll n) {
    if (n % 4 == 0) return n;
    if (n % 4 == 1) return 1;
    if (n % 4 == 2) return n + 1;
    if (n % 4 == 3) return 0;
}

int norm(int x) { return x >= mod ? x - mod : x; }

ll calc(ll n, ll sum) {
    // x + y + z <= n; (x ^ y ) ^ (x + y + z) = sum
    if (n < 0) return 0;
    if (sum == 0) return 0;
    memset(f,0,sizeof(f));
    f[0][0][1][0] = 1;
    for (int i = 0; i <= 61; ++ i) {
        int cn = (n >> i) & 1;
        int cs = (sum >> i) & 1;
        for (int j = 0; j <= 3; ++ j)
            for (int k = 0; k <= 1; ++ k)
            for (int l = 0; l <= 1; ++ l) {
                if (!f[i][j][k][l]) continue;
             //   printf("f<%d %d %d %d> = %d, cs = %d\n",i,j,k,l,f[i][j][k][l], cs);
                for (int x = 0; x <= 1; ++ x)
                    for (int y = 0; y <= 1; ++ y)
                    for (int z = 0; z <= 1; ++ z) {
                        int cur = (x + y + z + j) & 1;
                        int car = (x + y + z + j) >> 1;

                        if ((cur ^ (x ^ y)) != cs) continue;
                        assert(car <= 3);
                        int t = (k & (cur <= cn)) | (cur < cn);
                        f[i + 1][car][t][l|z] = norm(f[i + 1][car][t][l|z] + f[i][j][k][l]);
                    }
            }
    } return f[62][0][1][1];
}

void solve() {
    ll n,m;
    scanf("%lld%lld",&n,&m);
    ll x = pre(n) ^ m;
//    printf("x = %d\n",x);
//    printf(">%d\n",calc(n,x));
//    return ;
    ll ans = ( ( calc(n, x) + calc(m, x) ) % mod - calc(m - 1, x)  + mod ) % mod;
    printf("%lld\n",ans);
}

int main() {
    int t;scanf("%d",&t);while (t--)solve();
    return 0;
}
/*
4
3 0
3 1
3 12345678987654321
0 0
 */