#include <bits/stdc++.h>
using namespace std;
long long dp[2000][2000];
long long sm[2000][2000];
long long fact[2000];
long long dp0[2000][2000];
int main() {
  for (int m = 0; m < 2000; m++) dp[m][0] = 1, sm[m][0] = m + 1;
  for (int k = 1; k <= 50; k++) {
    dp[0][k] = sm[0][k] = 0;
    dp0[0][k] = (k == 1);
    for (int m = 1; m < 2000; m++) {
      dp[m][k] = 0;
      if (k == 1) {
        if (m >= k) dp[m][k] += sm[m - k][k - 1];
      } else {
        if (m > k) dp[m][k] += sm[m - k - 1][k - 1];
      }
      if (m >= k) dp[m][k] += dp[m - k][k];
      sm[m][k] = sm[m - 1][k] + dp[m][k];
      dp0[m][k] = dp[m][k] + sm[m - 1][k - 1];
      if (k == 1) dp0[m][k]++;
      sm[m][k] %= 1000000007;
      dp[m][k] %= 1000000007;
      dp0[m][k] %= 1000000007;
    }
  }
  fact[1] = 1;
  for (int i = 2; i < 2000; i++) fact[i] = (fact[i - 1] * i) % 1000000007;
  int t;
  scanf("%d", &t);
  int n, k;
  for (int i = 0; i < t; i++) {
    scanf("%d %d", &n, &k);
    printf("%d\n", (dp0[n - 1][k] * fact[k]) % 1000000007);
  }
}
