#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll f[40][2][2][2];
ll num1[40],tot,num2[40];
ll dfs(ll now,ll small1,ll small2,ll zero)
{
    if(now==0)return 1;
    if(f[now][small1][small2][zero]!=-1)return f[now][small1][small2][zero];
    ll res=0;
    ll mx=num1[now],my=num2[now];
    if(small1)mx=1;
    if(small2)my=1;
    for(int i=0;i<=mx;i++)
    {
        for(int j=0;j<=my;j++)
        {
            if(i&j)continue;
            ll k=1;
            if(zero&&(i||j))k=now;
            res=(res+dfs(now-1,small1||(i<num1[now]),small2||(j<num2[now]),zero&&(i==0)&&(j==0))*k%mod)%mod;
        }
    }
    f[now][small1][small2][zero]=res;
    return res;
}
void work()
{
    memset(f,-1,sizeof(f));
    memset(num1,0,sizeof(num1));
    memset(num2,0,sizeof(num2));
    tot=0;
    ll x,y;
    cin>>x>>y;
    if(x<y)swap(x,y);
    if(x==0&&y==0)
    {
        cout<<"0\n";
        return;
    }
    while(x)
    {
        tot++;
        num1[tot]=x%2;
        num2[tot]=y%2;
        x=x/2;
        y=y/2;
    }
    cout<<(dfs(tot,0,0,1)-1+mod)%mod<<'\n';
}
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)
    {
        work();
    }
}