#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 2e6 + 10;
const int mod = 1e9 + 7;
int fac[N], ifac[N], inv[N];

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

int add(int x, int y) {
    return x + y >= mod ? x + y - mod : x + y;
}

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

void solve() {
    ll n, m;
    scanf("%lld%lld", &n, &m);
    if (m >= n) {
        puts("0");
        return ;
    }
    int ans = 0;
    for (int i = 0; i <= n - m; ++i) {
        // ans = add(ans, 1ll * ifac[i - 2 * (n - m)] * C(i + (n - m) - 1, (n - m) - 1));
        ans = add(ans, 1ll * C(n - m, i) * C(m + i - 1, i - 1) % mod);
        // cerr << 1ll * 1ll * C(n - m, i) * C(m + i - 1, i - 1) % mod * fac[n] % mod * qpow(qpow(2), n - m) % mod << '\n';
    }
    ans = 1ll * ans * fac[n] % mod;
    ans = 1ll * ans * qpow(qpow(2), n - m) % mod;
    ans = 1ll * ans * ifac[n - m] % mod;
    printf("%d\n", ans);
}

int main() {
    fac[0] = fac[1] = inv[1] = ifac[0] = ifac[1] = 1;
    for (int i = 2; i <= 2000000; ++i) {
        fac[i] = 1ll * fac[i - 1] * i % mod;
        inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
        ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
    }
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}