#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 505;
int n, P, fc[N * N], ifc[N * N], f[N][N], ans[N][N], g[N], c[N][N];
inline void inc(int &x, int y) { x += y - P; x += (x >> 31) & P; }
inline void dec(int &x, int y) { x -= y; x += (x >> 31) & P; }
inline int power(int a, int b) { int res = 1; for(; b; b >>= 1, a = 1ll * a * a % P) if(b & 1) res = 1ll * res * a % P; return res; }
inline int C(int a, int b) { return a < b ? 0 : 1ll * fc[a] * ifc[b] % P * ifc[a - b] % P; }
inline void binom_init(int n) {
	fc[0] = ifc[0] = 1;
	rep(i, 1, n) fc[i] = 1ll * i * fc[i - 1] % P;
	ifc[n] = power(fc[n], P - 2);
	lep(i, n - 1, 1) ifc[i] = 1ll * (i + 1) * ifc[i + 1] % P;
}

signed main() {
	n = read(); P = read();
	binom_init(n * (n + 1));
	rep(i, 0, n) {
		c[i][0] = 1;
		rep(j, 1, i) inc(c[i][j] = c[i - 1][j], c[i - 1][j - 1]);
	}
	
	rep(x, 1, n) {
		rep(y, 1, n) {
			g[y] = 0;
			rep(i, 1, x) 
				if(i + y & 1) inc(g[y], 1ll * c[x][i]* (P - C(n + i * y - 1, n)) % P);
				else   	      inc(g[y], 1ll * c[x][i] * C(n + i * y - 1, n) % P);
			rep(i, 1, y) inc(f[x][y], 1ll * c[y][i] * g[i] % P);
			if(x + y & 1) f[x][y] = (P - f[x][y]) % P; 
		}
	}
	
	rep(i, 1, n) rep(j, 1, n) ans[n - i][n - j] = f[i][j];
	
	rep(i, 0, n - 1) lep(j, n - 1, 0) 
		rep(k, j + 1, n - 1) dec(ans[i][j], 1ll * c[k][j] * ans[i][k] % P);
	lep(i, n - 1, 0) rep(j, 0, n - 1)
		rep(k, i + 1, n - 1) dec(ans[i][j], 1ll * c[k][i] * ans[k][j] % P);
	
	rep(i, 0, n - 1) rep(j, 0, n - 1)
		printf("%d%c", ans[i][j], " \n"[j == n - 1]);
	return 0;
}