#include <bits/stdc++.h>
using namespace std;
const int MX = 1010;
const long long MOD = 1000000007;
long long a[MX];
int f[MX][50][MX], g[2][50][MX];
void init() {
  a[0] = 1;
  for (int i = 1; i <= 1000; i++) {
    a[i] = (a[i - 1] * i) % MOD;
  }
  for (int i = 1; i <= 1000; i++) {
    for (int j = 1; j <= 45; j++) {
      for (int k = j; k <= 1000; k++) {
        if (j == 1) {
          if (k <= i) {
            g[i & 1][j][k] = (g[(i - 1) & 1][j][k] + 1) % MOD;
          } else {
            g[i & 1][j][k] = 0;
          }
        } else {
          if (k <= i) {
            g[i & 1][j][k] =
                (g[(i - 1) & 1][j][k] + f[i - k][j - 1][k - 1]) % MOD;
          } else {
            g[i & 1][j][k] = 0;
          }
        }
        f[i][j][k] = (f[i][j][k - 1] + g[i & 1][j][k]) % MOD;
      }
    }
  }
}
int main() {
  init();
  int t, n, k;
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &k);
    if (k >= 50) {
      printf("0\n");
    } else {
      printf("%I64d\n", (long long)(f[n][k][1000]) * a[k] % MOD);
    }
  }
}
