#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 20;
const int MOD = 1000000007;
int k, n;
int fac[N], inv[N];
int C[N][N], p[N][N];
int fpow(int n, int k) {
  int ans = 1, base = n;
  while (k) {
    if (k & 1) ans = (long long)ans * base % MOD;
    base = (long long)base * base % MOD;
    k >>= 1;
  }
  return ans;
}
int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; }
void get_C(int n, int k) {
  C[n][k] = (long long)fac[n] * inv[k] % MOD * inv[n - k] % MOD;
}
void solve() {
  int ans = 0;
  for (int sum = (k) * (k - 1) / 2; sum + (k - 1) <= n; sum++) {
    ans = add(ans, (long long)p[sum + k - 1][k] * C[n - sum + 1][k] % MOD);
  }
  ans = (long long)ans * fac[k] % MOD;
  printf("%d\n", ans);
}
int main() {
  fac[0] = 1;
  for (int i = 1; i < N; i++) fac[i] = (long long)fac[i - 1] * i % MOD;
  inv[0] = 1;
  for (int i = 1; i < N; i++) inv[i] = fpow(fac[i], MOD - 2);
  for (int i = 1; i < N; i++)
    for (int j = 1; j <= i; j++) get_C(i, j);
  p[0][0] = 1;
  for (int i = 1; i < N; i++) {
    for (int j = 1; j <= i; j++) {
      p[i][j] = (p[i - j][j - 1] + p[i - j][j]) % MOD;
    }
  }
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d", &n, &k);
    solve();
  }
  return 0;
}
