#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPL(i,j, n) for (int i = (j); i < (n); i++)
#define int long long
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MOD = 1e9 + 7;
int modpow(int b, int p) {
    int cur = 1;    
    int mult = b;
    while (p) {
        if (p&1LL) {
            cur = cur*mult%MOD;
        }
        p /=2;
        mult = mult*mult%MOD;
    }
    return cur;
}
int modinv(int b) {
    return modpow(b, MOD-2);
}
const int MAX = 1e5+2;
vi facts(MAX,1);
vi invfact(MAX,1);
vi inv2(MAX,1);
int nCr(int n, int r) {
    if (n < 0 || r < 0 || n-r < 0) return 0;
    return facts[n]*invfact[r]%MOD*invfact[n-r]%MOD;
}
int barsStar(int objects, int part) {
    return nCr(objects-1, part - 1);
}
int solve() {
    int n,m;cin>>n>>m;
    if (m > n) {
        return 0;
    }
    if (m == n) {
        return facts[n-1]*inv2[1]%MOD;
    }
    if (m == 0) return 1;
    int tot = 0;
    int comps = n-m;
    int remaining = n - comps;
    int factor = nCr(n, comps)*facts[remaining]%MOD;
    //cout<<factor<<"...\n";
    REP(oneheads, comps) {
        int morehead = comps - oneheads;
        int f1 = barsStar(remaining, morehead);
        int f2 = nCr(comps, oneheads);
        int v1 = f1*f2%MOD*factor%MOD*inv2[morehead]%MOD;
        //cout<<f1<<"..."<<oneheads<<"\n";
        //cout<<v1<<"...\n";
        tot = (tot + v1)%MOD;
    }
    return tot%MOD;
}
signed  main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int iv2 = modinv(2);
    REPL(i, 1, MAX) {
        facts[i] = facts[i-1]*i%MOD;
        invfact[i] = modinv(facts[i]);
        inv2[i] = inv2[i-1]*iv2%MOD;
    }
    int t; cin >> t;
    while (t--) {
        cout<<solve()<<"\n";
    }
}