#include <bits/stdc++.h>
const long double eps = 1e-9;
const long double pi = acos(-1.0);
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 1e3 + 1;
long long dp[N][55], f[N], c[N][N], ans[N][N];
void inic() {
  f[0] = 1;
  for (int i = 1; i < N; i++) f[i] = (f[i - 1] * 1ll * i) % MOD;
  for (int i = 0; i <= 1000; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
      c[i][j] %= MOD;
    }
  }
}
void prec() {
  dp[0][0] = 1;
  for (int new_len = 1; new_len <= 1000; new_len++) {
    for (int last_len = 1000 - new_len; last_len >= 0; last_len--) {
      for (int cnt = 1; cnt <= 50; cnt++) {
        dp[new_len + last_len][cnt] += dp[last_len][cnt - 1];
        dp[new_len + last_len][cnt] %= MOD;
      }
    }
  }
  for (int new_len = 1; new_len <= 1000; new_len++) {
    for (int last_len = 1; last_len <= new_len; last_len++) {
      for (int cnt = 1; cnt <= 50; cnt++) {
        ans[new_len][cnt] += ((dp[last_len][cnt] * f[cnt] % MOD) *
                              c[cnt + new_len - last_len][cnt]) %
                             MOD;
        ans[new_len][cnt] %= MOD;
      }
    }
  }
}
void solve() {
  inic();
  prec();
  int n;
  cin >> n;
  while (n--) {
    int x, y;
    cin >> x >> y;
    cout << ans[x][y] << endl;
  }
}
int main() {
  ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
  cout.setf(ios::fixed), cout.precision(10);
  int step;
  step = 1;
  for (int i = 1; i <= step; i++) {
    solve();
  }
}
