#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = mul(x, x);
            n /= 2;
        } else {
            res = mul(res, x);
            --n;
        }
    }
    return res;
}

const int MAXF = 2e5 + 100;
int fact[MAXF], invf[MAXF];
const int HALF = (MOD + 1) / 2;
int pw2[MAXF], invpw2[MAXF];

int C(int n, int k) {
    if (k < 0 || k > n) return 0;
    return mul(fact[n], mul(invf[k], invf[n - k]));
}

void solve_() {
    int n;
    int64_t m;
    cin >> n >> m;
    if (m > n) {
        cout << "0\n";
        return;
    }
    if (m == n) {
        cout << mul(fact[n - 1], HALF) << "\n";
        return;
    }
    int l = n - m;
    int ans = 0;
    for (int i = 0; i <= m; ++i) {
        if (m - i > n - m) continue;
        int cur = C(i + l - 1, l - 1);
        cur = mul(cur, C(l, m - i));
        cur = mul(cur, pw2[n - 2 * m + i]);
        if ((m - i) % 2 == 0) {
            ans = add(ans, cur);
        } else {
            ans = sub(ans, cur);
        }
    }
    ans = mul(ans, fact[n]);
    ans = mul(ans, invf[l]);
    ans = mul(ans, invpw2[n - m]);
    cout << ans << "\n";
}

#define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    fact[0] = 1;
    pw2[0] = invpw2[0] = 1;
    for (int i = 1; i < MAXF; ++i) {
        fact[i] = mul(fact[i - 1], i);
        pw2[i] = mul(pw2[i - 1], 2);
        invpw2[i] = mul(invpw2[i - 1], HALF);
    }
    invf[MAXF - 1] = pw(fact[MAXF - 1], MOD - 2);
    for (int i = MAXF - 1; i > 0; --i) {
        invf[i - 1] = mul(invf[i], i);
    }


    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}