#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1000;
const int MAXM = 50;
int t;
int n, m;
int sum[MAXM + 10][MAXN + 10][MAXN + 10];
int quickpow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = (long long)res * x % MOD;
    x = (long long)x * x % MOD;
    y >>= 1;
  }
  return res;
}
int ny[MAXN + 10];
void getny() {
  for (int i = 1; i <= MAXN; ++i) ny[i] = quickpow(i, MOD - 2);
}
int main() {
  getny();
  for (int i = 1; i <= MAXM; ++i) {
    for (int j = 1; j <= MAXN; ++j) {
      for (int k = 1; k <= MAXN; ++k) {
        sum[i][j][k] = sum[i][j][k - 1];
        if (i == 1) {
          if (j == k) (++sum[i][j][k]) %= MOD;
        } else if (j >= k)
          (sum[i][j][k] += sum[i - 1][j - k][k - 1]) %= MOD;
      }
    }
  }
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &m);
    if (m > 50) {
      puts("0");
      continue;
    }
    int res = 0, now = 1, a, b;
    for (int i = 2; i <= m; ++i) now = (long long)now * i % MOD;
    for (int i = n; i >= 0; --i) {
      res = ((long long)res + (long long)sum[m][i][i] * now % MOD) % MOD;
      a = n - i + 1 + m;
      b = n - i + 1;
      now = (long long)now * a % MOD * ny[b] % MOD;
    }
    printf("%d\n", res);
  }
  return 0;
}
