#include<stdio.h>
#include<algorithm>
#include<cstring>
typedef unsigned int uint;
typedef unsigned long long ull;
constexpr uint mod{1000000007};
constexpr uint plus(const uint &x,const uint &y) {
    if(x+y>=mod) {
        return x+y-mod;
    }
    return x+y;
}
namespace DP1 {
    uint dp[61][2][3];
    int vis[61][2][3];
    uint dfs(const ull &n,const ull &v,const int &cur,const int &lim,const int &rem) {
        if(cur==-1) {
            return rem>0;
        }
        if(vis[cur][lim][rem]) {
            return dp[cur][lim][rem];
        }
        uint res{0};
        int up{lim?int(n>>cur&1):1};
        for(int i=0;i<=up;i++) {
            for(int a=0;a<=1;a++) {
                int b{int(v>>cur&1)^i^a};
                if((rem<<1)+i>=a+b) {
                    res=plus(res,dfs(n,v,cur-1,lim&&i==up,std::min(2,(rem<<1)+i-a-b)));
                }
            }
        }
        vis[cur][lim][rem]=1;
        dp[cur][lim][rem]=res;
        return res;
    }
    uint calc(const ull &n,const ull &v) {
        std::memset(dp,0,sizeof(dp));
        std::memset(vis,0,sizeof(vis));
        return dfs(n,v,60,1,0);
    }
}
namespace DP2 {
    uint dp[61][3];
    int vis[61][3];
    uint dfs(const ull &n,const ull &v,const int &cur,const int &rem) {
        if(cur==-1) {
            return rem>0;
        }
        if(vis[cur][rem]) {
            return dp[cur][rem];
        }
        uint res{0};
        int i{int(n>>cur&1)};
        for(int a=0;a<=1;a++) {
            int b{int(v>>cur&1)^i^a};
            if((rem<<1)+i>=a+b) {
                res=plus(res,dfs(n,v,cur-1,std::min(2,(rem<<1)+i-a-b)));
            }
        }
        vis[cur][rem]=1;
        dp[cur][rem]=res;
        return res;
    }
    uint calc(const ull &n,const ull &v) {
        std::memset(dp,0,sizeof(dp));
        std::memset(vis,0,sizeof(vis));
        return dfs(n,v,60,0);
    }
}
void solve() {
    ull n,m;
    scanf("%llu%llu",&n,&m);
    ull v{(n==0?0:(n&1?0:n)^(n-1>>1&1^1))^m};
    if(v==0) {
        return puts("0"),void();
    }
    printf("%u\n",plus(DP1::calc(n,v),DP2::calc(m,v)));
}
int main() {
    int t;
    scanf("%d",&t);
    while(t--) {
        solve();
    }
    return 0;
}