#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int const N = 1000 + 2, K = 45 + 2, mod = 1e9 + 7;
int T;
int dp[N][K], res[N][K];
int C[N][N];
void calc() {
  for (int i = 0; i < N; 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]) % mod;
  }
  dp[0][0] = 1;
  for (int d = 0; d < N; d++)
    for (int k = K - 2; k >= 0; k--)
      for (int i = 0; i + d < N; i++)
        dp[i + d][k + 1] = (dp[i + d][k + 1] + 1ll * (k + 1) * dp[i][k]) % mod;
  for (int i = 0; i < N; i++)
    for (int k = 0; k < K; k++)
      for (int j = 0; j <= i; j++)
        res[i][k] = (res[i][k] + 1ll * dp[j][k] * C[i - j][k]) % mod;
}
int main() {
  calc();
  scanf("%d ", &T);
  while (T--) {
    int n, k;
    scanf("%d %d ", &n, &k);
    printf("%d\n", (k < K ? res[n][k] : 0));
  }
}
