#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n, f[2][505][505];
int mod;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> mod;
	f[1][1][0] = 1;
	for (int i = 1; i < n; i++) {
		memset(f[!(i & 1)], 0, sizeof(f[!(i & 1)]));
		for (int j = 1; j <= i; j++) {
			for (int k = 0; k <= i; k++) {
				f[!(i & 1)][j + 1][k] = (1ll * f[!(i & 1)][j + 1][k] + f[i & 1][j][k]) % mod;
				f[!(i & 1)][j][k] = (1ll * f[!(i & 1)][j ][k] + 1ll * (k) * f[i & 1][j][k]) % mod;
				f[!(i & 1)][j][k + 1] = (1ll * f[!(i & 1)][j][k + 1] + 1ll * (i - k) * f[i & 1][j][k]) % mod;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cout << f[n & 1][i][j] << ' ';
		}
		cout << "\n";
	}
}
//状态定义为 i 点 j 联通 k 上升

//然后就枚举最新点放哪一个点后面，如果放在上升的后面就不变，否则加1

//也可以自成一家就是了

//bukachangbukachangbukachangbukachangbukachangbukachang
//bukachangbukachangbukachangbukachangbukachangbukachang
//bukachangbukachangbukachangbukachangbukachangbukachang
//bukachangbukachangbukachangbukachangbukachangbukachang
//bukachangbukachangbukachangbukachangbukachangbukachang
//bukachangbukachangbukachangbukachangbukachangbukachang