#include<iostream>
#include<cstdio>
#define N 250000
#define M 500
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,mod,fac[N+1],invfac[N+1],W[M+1][M+1],F[M+1][M+1],G[M+1][M+1],H[M+1][M+1];
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int C(int x,int y)
{
	if (x<y) return 0;
	return 1ll*fac[x]*invfac[y]%mod*invfac[x-y]%mod;
}
int main()
{
	n=read(),mod=read(),fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			for (int k=1;k<=j;++k)
			{
				if (!((j-k)&1)) Adder(W[i][j],1ll*C(j,k)*C(i*k,n)%mod);
				else Adder2(W[i][j],-1ll*C(j,k)*C(i*k,n)%mod);
			}
	for (int i=1;i<=n;++i)
		for (int j=0;j<=n-1;++j)
			for (int k=j;k<=n-1;++k)
			{
				if (!((k-j)&1)) Adder(F[i][j],1ll*C(k,j)*W[i][n-k]%mod);
				else Adder2(F[i][j],-1ll*C(k,j)*W[i][n-k]%mod);
			}
	for (int i=1;i<=n;++i)
		for (int j=0;j<=n-1;++j)
			for (int k=1;k<=i;++k)
			{
				if (!((i-k)&1)) Adder(G[i][j],1ll*C(i,k)*F[k][j]%mod);
				else Adder2(G[i][j],-1ll*C(i,k)*F[k][j]%mod);
			}
	for (int i=0;i<=n-1;++i)
		for (int j=0;j<=n-1;++j)
			for (int k=i;k<=n-1;++k)
			{
				if (!((k-i)&1)) Adder(H[i][j],1ll*C(k,i)*G[n-k][j]%mod);
				else Adder2(H[i][j],-1ll*C(k,i)*G[n-k][j]%mod);
			}
	for (int i=0;i<=n-1;++i)
	{
		for (int j=0;j<=n-1;++j) printf("%d ",H[i][n-1-j]);
		puts("");
	}
	return 0;
}