#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 505
IL int read()
{
    reg int x=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x;
}

int mod;

typedef unsigned long long u64;
typedef __uint128_t u128;

struct fastmod {
  int m;
  u64 b;

  fastmod(int m) : m(m), b(((u128)1 << 64) / m) {}
  int reduce(u64 a) {
    u64 q = ((u128)a * b) >> 64;
    int r = a - q * m;
    return r < m ? r : r - m;
  }
} z(2);

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg long long r=1ll*x*y; return r<mod?r:z.reduce(r);}

int fac[1000100],ifac[1000100],inv[1000100];

IL void init(reg int n)
{
    fac[0]=ifac[0]=inv[1]=1;
    for(reg int i=2;i<=n;++i)inv[i]=Mul(mod-mod/i,inv[mod%i]);
    for(reg int i=1;i<=n;++i)fac[i]=Mul(fac[i-1],i),ifac[i]=Mul(ifac[i-1],inv[i]);
}

IL int C(reg int n,reg int m){return Mul(fac[n],Mul(ifac[m],ifac[n-m]));}

int n,f[N][N],g[N][N];

main()
{
    n=read(),z=fastmod(mod=read()),init(1e6);
    for(reg int i=1,j;i<=n;++i)for(j=1;j<=n;++j)f[i][j]=C(i*j+n-1,n);
    for(reg int i=1,j,k,w;i<=n;++i)for(j=1;j<=n;++j)for(k=1;k<=i;++k)
    {
    	w=Mul(C(i,k),f[k][j]);
    	if(i-k&1)Dec(g[i][j],w); else Pls(g[i][j],w);
	}
	for(reg int i=1,j;i<=n;++i)for(j=1;j<=n;++j)f[i][j]=g[i][j],g[i][j]=0;
    for(reg int i=1,j,k,w;i<=n;++i)for(j=1;j<=n;++j)for(k=1;k<=j;++k)
    {
    	w=Mul(C(j,k),f[i][k]);
    	if(j-k&1)Dec(g[i][j],w); else Pls(g[i][j],w);
	}
	for(reg int i=1,j;i<=n;++i)for(j=1;j<=n;++j)f[n-i][n-j]=g[i][j],g[i][j]=0;
	for(reg int i=0,j,k,w;i<n;++i)for(j=0;j<n;++j)for(k=i;k<n;++k)
	{
		w=Mul(C(k,i),f[k][j]);
		if(k-i&1)Dec(g[i][j],w); else Pls(g[i][j],w);
	}
	for(reg int i=0,j;i<n;++i)for(j=0;j<n;++j)f[i][j]=g[i][j],g[i][j]=0;
	for(reg int i=0,j,k,w;i<n;++i)for(j=0;j<n;++j)for(k=j;k<n;++k)
	{
		w=Mul(C(k,j),f[i][k]);
		if(k-j&1)Dec(g[i][j],w); else Pls(g[i][j],w);
	}	
    for(reg int i=0,j;i<n;++i)for(j=0;j<n;++j)printf("%d%c",g[i][j]," \n"[j==n-1]);
}