#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;
int p[maxn],inv[maxn];
int n,m;
int ppow(int x, int y)
{
    int temp=1LL;
    while (y)
    {
        if (y&1) temp=temp*x%mod;
        x=x*x%mod;
        y/=2;
    }
    return temp;
}
void precalc()
{
    int lim = 2e5;
    p[0]=1LL;
    for (int i=1; i<=lim; i++) p[i]=p[i-1]*i%mod;
    inv[lim] = ppow(p[lim],mod-2);
    for (int i=lim-1; i>=0; i--) inv[i]=inv[i+1]*(i+1)%mod;
}
int C(int x, int y)
{
    if (x>y) return 0;
    return p[y]*inv[x]%mod*inv[y-x]%mod;
}

void xuly()
{
    cin>>n>>m;
    if (m>n)
    {
        cout<<"0\n";
        return;
    }
    if (m==0)
    {
        cout<<1<<'\n';
        return;
    }
    if (m==n)
    {
        int ans = p[n-1]*ppow(2,mod-2)%mod;
        cout<<ans<<'\n';
        return;
    }
    int ans = 0;
    int pre = 1LL;
    for (int i=1; i<=n-m; i++)
    {
        if (m+i<2*i) continue;
        int val = C(n-m-i,n)*pre%mod * C(2*i,m+i)%mod;
        pre = pre*(2*i+1)%mod;
        val = val*p[m-i]%mod*C(i-1,m-1)%mod;
//        cout<<i<<" = "<<val<<'\n';
       ans=(ans+val)%mod;
    }
    cout<<ans<<'\n';
}
/**
n-2*i cho
**/

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    precalc();
    int tt; cin>>tt;
    while (tt--) xuly();
}