#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define x first
#define y second
#define vi vector<int>
#define vpi vector<pii>
#define all(x) (x).begin(),(x).end()
using namespace std;

inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

const int Mod=1e9+7;
const int M=1e5+10;
const int inv2=(Mod+1)/2;
int n,T,fac[M],ifac[M],pwiv2[M];

int poww(int a,int b=Mod-2)
{
    int res=1;
    while(b)
    {
        if (b&1)res=res*a%Mod;
        a=a*a%Mod,b>>=1;
    }
    return res;
}

void init(int n)
{
    fac[0]=pwiv2[0]=1;
    for (int i=1;i<=n;i++)fac[i]=fac[i-1]*i%Mod,pwiv2[i]=pwiv2[i-1]*inv2%Mod;
    ifac[n]=poww(fac[n]);
    for (int i=n;i>=1;i--)ifac[i-1]=ifac[i]*i%Mod;
}

int C(int m,int n)
{
    if (n<0||m<n)return 0;
    return fac[m]*ifac[n]%Mod*ifac[m-n]%Mod;
}

int calc(int m,int n)
{
    if (m<2*n)return 0;
    if (n==0)return m==0;
    return C(m-n-1,n-1);
}

signed main()
{
    init(1e5);
    int T=read();
    while(T--)
    {
        int n=read(),m=read();
        if (m>n)
        {
            puts("0");
            continue;
        }
        if (m==n)
        {
            cout<<fac[n-1]*inv2%Mod<<'\n';
            continue;
        }
        int ans=0;
        int k=n-m;
        for (int i=0;i<=k;i++)
            ans=(ans+pwiv2[k-i]*fac[n-i]%Mod*C(n,i)%Mod*ifac[k-i]%Mod*calc(n-i,k-i))%Mod;
        cout<<ans<<'\n';
    }
    return 0;
}