#include<iostream>
#include<cstdio>
#include<cassert>
#define N 81
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,sz,mod,d,tres=1,inv[N+1],Cs[N+1][N+1],ans[N+1][N+1],dp[N+1][N+1][N+1][N+1],DP[N+1][N+1][N+1][N+1],A[N+1][N+1][N+1],B[N+1][N+1][N+1],C[N+1][N+1][N+1],maxn[N+1][N+1],maxn2[N+1][N+1];
long long delta[N+1][N+1][N+1];
unsigned long long smod;
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int mul(int x,int y)
{
	long long d=1ll*x*y;
	d-=(((unsigned __int128)(d)*smod)>>62)*mod;
	return d>=mod?d-mod:d;
}
int main()
{
	int rst;
	n=read(),mod=read(),smod=(1ull<<62)/mod,inv[1]=1;
	for (int i=2;i<=N;++i) inv[i]=MD2(-1ll*inv[mod%i]*(mod/i)%mod);
	for (int i=0;i<=N;++i) Cs[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			Cs[i][j]=MD(Cs[i-1][j-1]+Cs[i-1][j]);
	for (int i=1;i<=n-2;++i) tres=1ll*tres*n%mod;
    Adder(ans[1][n],tres);
	for (int i=1;i<=n;++i)
	{
		sz=n/i;
		for (int j=1;j<=n;++j)
			for (int k=0;k<=i;++k)
			{
				if (k==i)
				{
					for (int t=0;t<=sz;++t)
						for (int w=0;w<=n;++w)
							dp[j][k][t][w]=DP[j][k][t][w]=0;
				}
				else dp[j][k][0][0]=DP[j][k][0][0]=0;
			}
		DP[0][0][0][0]=1;
		for (int j=0;j<=n;++j)
			for (int k=0;k<=min(i,j);++k)
			{
				if (k!=i) maxn[j][k]=maxn2[j][k]=0;
				else maxn[j][k]=j/i,maxn2[j][k]=j;
			}
		for (int j=1;j<=n;++j)
		{
			for (int k=0;k<=min(i,j-1);++k)
				for (int t=0;t<=maxn[j-1][k];++t)
					for (int w=0;w<=maxn2[j-1][k];++w)
						if (DP[j-1][k][t][w])
						{
							if (k+1==i) rst=i;
							else if (k+1>i) rst=1;
							else rst=0;
							Adder(dp[j][min(k+1,i)][t+(k+1==i)][w+rst],mul(DP[j-1][k][t][w],j));
						}
			for (int k=1;k<=j;++k)
			{
				d=min(max(k,j-k),i);
				for (int t=0;t<=d;++t)
					for (int z=0;z<=maxn[j][t];++z)
						for (int w=0;w<=maxn2[j][t];++w)
							A[t][z][w]=dp[k][t][z][w],B[t][z][w]=DP[j-k][t][z][w],delta[t][z][w]=0;
				for (int t=1;t<=d;++t) Adder(A[t][0][0],A[t-1][0][0]),Adder(B[t][0][0],B[t-1][0][0]);
				for (int t=0;t<=d;++t)
					for (int z=0;z<=maxn[k][t];++z)
						for (int w=0;w<=maxn2[k][t];++w)
							if (A[t][z][w])
							{
								for (int z2=0;z2<=maxn[j-k][t];++z2)
									for (int w2=0;w2<=maxn2[j-k][t];++w2)
										if (B[t][z2][w2])
											delta[t][z+z2][w+w2]+=mul(A[t][z][w],B[t][z2][w2]);
							}
				for (int t=0;t<=d;++t)
					for (int z=0;z<=maxn[j][t];++z)
						for (int w=0;w<=maxn2[j][t];++w)
							C[t][z][w]=delta[t][z][w]%mod;
				for (int t=d;t>=1;--t) Adder2(C[t][0][0],-C[t-1][0][0]);
				for (int t=0;t<=d;++t)
					for (int z=0;z<=maxn[j][t];++z)
						for (int w=0;w<=maxn2[j][t];++w)
							if (C[t][z][w])
								Adder(DP[j][t][z][w],mul(C[t][z][w],Cs[j-1][k-1]));
			}
		}
		for (int j=0;j<=i;++j)
			for (int k=0;k<=maxn[n][j];++k)
				for (int t=0;t<=maxn2[n][j];++t)
					if (dp[n][j][k][t])
					{
						for (int w=k+1;w<=n&&t+(i-1)*(w-k)<=n;++w) Adder(ans[w][t+(i-1)*(w-k)],1ll*dp[n][j][k][t]*inv[n]%mod);
						for (int w=k+1;w<=n&&t+i*(w-k)<=n;++w) Adder2(ans[w][t+i*(w-k)],-1ll*dp[n][j][k][t]*inv[n]%mod);
					}
	}
	for (int i=1;i<=n;++i)
	{
		for (int j=1;j<=n;++j) printf("%d ",ans[i][j]);
		puts("");
	}
	return 0;
}