#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000 + 5;
const long long mod = 1000 * 1000 * 1000 + 7;
long long c[maxN][maxN];
long long fact[maxN];
long long add(long long x, long long y) { return (x + y) % mod; }
long long mul(long long x, long long y) { return (x * y) % mod; }
long long b[maxN][maxN];
int main() {
  ios_base::sync_with_stdio(false);
  c[0][0] = 1;
  for (int i = 1; i < maxN; i++) {
    c[i][i] = c[i][0] = 1;
    for (int j = 1; j < i; j++) c[i][j] = add(c[i - 1][j - 1], c[i - 1][j]);
  }
  int N = maxN - 2;
  fact[0] = 1;
  for (int i = 1; i < maxN; i++) fact[i] = mul(fact[i - 1], i);
  b[0][1] = 1;
  b[1][2] = 1;
  for (int i = 1; i <= N; i++)
    for (int k = 1; k <= i; k++)
      b[i][k] = add(b[i - k][k], b[i - k + 1][k - 1]);
  for (int i = 1; i <= N; i++)
    for (int k = 1; k <= N; k++) b[i][k] = mul(b[i][k], fact[k]);
  int T;
  cin >> T;
  while (T--) {
    int n, k;
    cin >> n >> k;
    if (n - k < 0 || k * (k - 1) / 2 > n - k) {
      cout << 0 << endl;
      continue;
    }
    long long ans = 0;
    for (int i = 0; i <= n; i++) ans = (ans + b[i][k] * c[n - i][k]) % mod;
    cout << ans << "\n";
  }
  return 0;
}
