#include <bits/stdc++.h>
using namespace std;
#define int long long
#define max_n 511111
#define mo 1000000007
void read(int &p)
{
    p = 0;
    int k = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
        {
            k = -1;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9')
    {
        p = p * 10 + c - '0';
        c = getchar();
    }
    p *= k;
    return;
}
void write_(int x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
    {
        write_(x / 10);
    }
    putchar(x % 10 + '0');
}
void writesp(int x)
{
    write_(x);
    putchar(' ');
}
void writeln(int x)
{
    write_(x);
    putchar('\n');
}
int T,n,m;
int ksm(int a,int b)
{
    int pi = 1;
    for(;b;b >>= 1,a = (a * a) % mo)
    {
        if(b & 1)
        {
            pi = (pi * a) % mo;
        }
    }
    return pi;
}
int jiecheng[max_n],inv[max_n];
int ans = 0;
void solution()
{
    read(n),read(m);

    if(m > n)
    {
        puts("0");
        return ;
    }
    if(m == 0)
    {
        puts("1");
        return ;
    }
    if(n == m)
    {
        writeln((ksm(2,mo - 2) * jiecheng[n - 1] ) % mo);
        return ;
    }
    ans = 0;
    int pi = 1;
    for(int i = 1;i + m <= n && i <= m;++i)
    {
        (ans += 
        pi *
        jiecheng[m - i] % mo*
        jiecheng[n] % mo * 
        inv[n - m - i] % mo * 
        inv[m + i] % mo * 
        jiecheng[m + i] % mo * 
        inv[i << 1LL] % mo *
        inv[m - i] % mo *
        jiecheng[m - 1] % mo * 
        inv[i - 1] % mo *
        inv[m - i] % mo) %= mo; 
        pi = (pi *((i<<1) | 1) % mo);
    }
    writeln(ans);
}
signed main()
{  
    jiecheng[0] = 1;
    for(int i = 1;i <= 400000;i++)
    {
        jiecheng[i] = (jiecheng[i - 1] * i) % mo;
    }
    inv[400000] = ksm(jiecheng[400000],mo - 2);
    for(int i = 399999;~i;i--)
    {
        inv[i] = (inv[i + 1] * (i + 1)) % mo;
    }
    read(T);
    while(T--)
    {
        solution();
    }
    return 0;
}