mod = 10 ** 9 + 7
nn = 100000
fact = [1] * nn
for i in range(nn - 1):
    fact[i + 1] = fact[i] * (i + 1) % mod
invfact = [1] * nn
invfact[nn - 1] = pow(fact[nn - 1], mod - 2, mod)
for i in range(nn - 1)[::-1]:
    invfact[i] = invfact[i + 1] * (i + 1) % mod
 
def binom(x, y):
    if x < 0 or y < 0 or x - y < 0:
        return 0
    return fact[x] * invfact[y] % mod * invfact[x - y] % mod

def greedy(n, m):
    
    if m > n:
        return 0
    elif m == n:
        return fact[n-1] * pow(2, mod-2, mod) % mod
    g = [0] * (n + 1)
    g[0] = 1
    for _ in range(n-m):
        ng = [0] * (n + 1)
        for i in range(n):
            for j in range(1, n - i + 1):
                if j > 1:
                    ng[i+j] += g[i] * j * pow(2 * (i + j), mod-2, mod) % mod
                else:
                    ng[i+j] += g[i] * pow(i + 1, mod-2, mod) % mod
                ng[i+j] %= mod
        g = ng
        # print(g)
    return fact[n] * g[n] % mod

for _ in range(int(input())):
    n, m = map(int, input().split())
    print(greedy(n, m))