#include <bits/stdc++.h>
using namespace std;

const int md = 1e9 + 7;

inline int add(int x, int y) {
	if (x + y >= md) return x + y - md;
	return x + y;
}

inline int sub(int x, int y) {
	if (x < y) return x - y + md;
	return x - y;
}

inline int mul(int x, int y) {
	return 1ull * x * y % md;
}

inline int fpow(int x, int y) {
	int ans = 1;
	while (y) {
		if (y & 1) ans = mul(ans, x);
		y >>= 1; x = mul(x, x);
	}
	return ans;
}

const int N = 505, M = 5005;

vector < pair <int, int> > vec[N];
int f[2][N][M][2];
int ans[1005];
int T, n, m;

inline void upd(int &x, int y) {
	x = add(x, y);
}

int main() {
	scanf("%d", &T);
	for (int i = 1; i <= T; i++) {
		scanf("%d%d", &n, &m);
		vec[n].emplace_back(m, i);
	}
	f[0][0][0][0] = 1;
	for (int i = 0; i < 500; i++) {
		int cur = i & 1;
		memset(f[cur ^ 1], 0, sizeof(f[0]));
		for (int j = 0; j <= i; j++) {
			for (int k = 0; k <= 5000 - j * (j + 1) / 2; k++) {
				for (int o = 0; o <= 1; o++) {
					if (!f[cur][j][k][o]) continue;
					int now = f[cur][j][k][o];
					if (j) {
						int x = j / 2 * (j / 2);
						int y = (j + 1) / 2 * ((j + 1) / 2);
						upd(f[cur ^ 1][j - 1][j + k][o], mul(now, x + y));
						upd(f[cur ^ 1][j - 1][j + k][o ^ 1], mul(now, j * j - x - y));
					}
					int x = j / 2 + 1;
					upd(f[cur ^ 1][j][j + k][o], mul(now, 2 * x - 1));
					upd(f[cur ^ 1][j][j + k][o ^ 1], mul(now, j * 2 + 2 - 2 * x));
					upd(f[cur ^ 1][j + 1][j + k][o ^ ((j + 1) % 2)], now);
				}
			}
		}
		for (auto j : vec[i + 1]) {
			for (int k = 0; k <= j.first; k++) upd(ans[j.second], f[cur ^ 1][0][k][(i + 1) % 2]);
		}
	}
	for (int i = 1; i <= T; i++) printf("%d\n", ans[i]);
	return 0;
}