#include <bits/stdc++.h>
const int mod = 1000000007;
long long dp[1010][1010], c[1010][1010], fac[1010];
int T, n, k;
using namespace std;
int main() {
  dp[0][0] = 1;
  for (int add = 1; add <= 1000; add++)
    for (int i = 1000; i >= add; i--) {
      int j = 1;
      while (j * (j - 1) / 2 <= i - add) {
        dp[i][j] += dp[i - add][j - 1];
        dp[i][j] %= mod;
        j++;
      }
    }
  c[0][0] = 1;
  for (int i = 1; i <= 1000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
  }
  fac[0] = 1;
  for (int i = 1; i <= 1000; i++) fac[i] = fac[i - 1] * i % mod;
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d", &n, &k);
    long long ans = 0;
    for (int i = k * (k + 1) / 2; i <= n; i++) {
      ans += dp[i][k] * fac[k] % mod * c[k + 1 + n - i - 1][n - i] % mod;
      ans %= mod;
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
