#include <bits/stdc++.h>
using namespace std;
int n, K;
int tot[55][1009][1009], C[1009][1009];
long long F[55];
void init() {
  for (int i = 0; i <= 1000; ++i) tot[0][0][i] = 1;
  for (int i = 1; i < 50; ++i) {
    for (int j = (i + 1) * i / 2; j <= 1000; ++j) {
      for (int k = i; k <= 1000; ++k) {
        tot[i][j][k] =
            tot[i][j][k - 1] + (j - k >= 0 ? tot[i - 1][j - k][k - 1] : 0);
        tot[i][j][k] %= 1000000007;
      }
    }
  }
  C[0][0] = 1;
  for (int i = 1; i <= 1000; ++i) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j <= i; ++j) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      C[i][j] %= 1000000007;
    }
  }
  F[1] = 1;
  for (int i = 2; i <= 50; ++i) F[i] = (F[i - 1] * (long long)i) % 1000000007;
}
int main() {
  init();
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, k;
    scanf("%d%d", &n, &k);
    long long ans = 0;
    for (int i = (k + 1) * k / 2; i <= n; ++i) {
      ans += ((long long)tot[k][i][1000] * C[n - i + k][k]) %
             (long long)1000000007;
      ans %= (long long)1000000007;
    }
    ans = (ans * F[k]) % (long long)1000000007;
    printf("%I64d\n", ans);
  }
}
