#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
typedef pair<int,int> pii;

const int mod=1e9+7;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=1e5+10;

int fact[maxn],inv[maxn],prek2[maxn];
int c(int n,int k){
    if(n<0 || k<0 || n<k)return 0;
    return mul(fact[n],mul(inv[k],inv[n-k]));
}
int pw2(int n){

    if(n<0)return 0;
    if(n==0)return 1;
    if(prek2[n]!=-1)return prek2[n];

    prek2[n]=mul(pw2(n-1),2);
    return prek2[n];
}

int main() {


    ///freopen("test.txt","r",stdin);

    inv[0]=fact[0]=1;
    for(int i=1;i<maxn;i++){
        fact[i]=mul(fact[i-1],i);
        inv[i]=invv(fact[i]);
    }
    memset(prek2,-1,sizeof(prek2));

    int t;
    scanf("%d",&t);
    while(t--){

        int n;
        ll m;
        scanf("%d %lld",&n,&m);
        ll k=n-m;
        if(k<0){
            printf("0\n");
            continue;
        }
        if(k==0){
            printf("1\n");
            continue;
        }



        int rez=0;
        for(int i=0;i<=n-1;i++){

            int oc=n-1-i;
            int pom=1;
            if(oc%2)pom=mod-1;

            rez=add( rez, mul( c(i,k-1) , mul(c(k,oc),mul(pom,pw2(k-oc)) ) ) );

        }

        rez=mul(rez,fact[n]);
        rez=mul(rez,inv[k]);
        rez=mul(rez,invv(step(2,k)));

        printf("%d\n",rez);

    }


    return 0;
}