#include<bits/stdc++.h>
using namespace std;typedef long long ll;typedef __int128 lll;const ll p=1e9+7;const lll inf=1e26;
ll fpow(ll x,ll y){ll s=1;while(y){if(y&1)s=s*x%p;x=x*x%p;y>>=1;}return s;}lll f[69][69],C[57][57];
lll fact(ll x,ll y){
	if(x<=50)return y>x?0:C[x][y];
	lll g=1;int fl=0;for(int i=1;i<=y;++i){g*=(x-i+1);if(g>inf)g/=f[fl+1][i],fl=i;}
	if(fl<y)g/=f[fl+1][y];return g;
}
void sol(){
	ll n,m,l=1,r=2e9,mid,x;scanf("%lld%lld",&n,&m);
	while(l<r){mid=(l+r+1)/2;if(mid*(mid-1)/2<n)l=mid;else r=mid-1;}
	r=l-n+l*(l-1)/2-1;x=(fpow(2,l)-fpow(2,r+1)+p)%p;if(r<=0){printf("%lld\n",m==1?x:-1);return;}
	if(r<=60&&m>(1ll<<r)){puts("-1");return;}
	lll t=1;for(int i=0;i<=r;++i){
		if(m<=t){
			for(int j=i;j;--j){
				ll L=0,R=r-1,mid;
				while(L<R){
					mid=(L+R+1)/2;
					if(fact(mid,j)>=m)R=mid-1;else L=mid;
				}
				m-=fact(L,j);r=L;x=(x+fpow(2,L))%p;
			}
			printf("%lld\n",x);return;
		}
		m-=t;t=t*(r-i)/(i+1);
	}
}
int main(){
	for(int i=1;i<69;++i)for(int j=i;j<69;++j){f[i][j]=1;for(int k=i;k<=j;++k)f[i][j]*=k;}
	for(int i=0;i<=50;++i){
		C[i][0]=1;for(int j=1;j<=i;++j)C[i][j]=C[i][j-1]*(i-j+1)/j;
	}
	int t;scanf("%d",&t);while(t--)sol();return 0;
}