#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
int n, m, mod;
int f[305][305], g[305][305], sg[305][305];
int qmod(int x) { return x >= mod ? x - mod : x; }
void MAIN() {
	read(n); read(m); read(mod);
	memset(f, 0, sizeof(f));
	f[1][1] = 1;
	for (int i = 1; i <= m; i++) {
		if (i <= 2 * n) {
			memcpy(g, f, sizeof(f));
			memset(f, 0, sizeof(f));
			for (int j = 1; j <= n; j++) {
				for (int k = 1; k <= n; k++) {
					sg[j][k] = qmod(sg[j][k - 1] + g[j][k]);
				}
			}
		} else {
			for (int k = 1; k <= n; k++) {
				g[n][k] = f[n][k];
				sg[n][k] = qmod(sg[n][k - 1] + g[n][k]);
			}
		}
		for (int j = 1; j <= n; j++) {
			if (j < n && i > 2 * n) continue;
			for (int k = 1; k <= j; k++) {
				f[j][k] = qmod(g[j - 1][k] + f[j][k]);
				if (j == n) f[j][k] = qmod(g[j][k] + f[j][k]);
				f[j][k] = qmod(f[j][k] + sg[j][k - 1]);
			}
		}
		int ans = 0;
		if (i <= 2 * n) {
			for (int j = 1; j <= n; j++) {
				for (int k = 1; k <= n; k++) {
					ans = qmod(ans + f[j][k]);
				}
			}
		} else {
			for (int k = 1; k <= n; k++) {
				ans = qmod(ans + f[n][k]);
			}
		}
		printf("%d ", ans);
	} puts("");
}
int main() {
	int T;
	read(T);
	while (T--) MAIN();
	return 0;
}