#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,mod,jc[300030],jcinv[300030],f[550][550];
struct FastMod{
	#define ull unsigned long long
	ull n,m;
	il void init(ull p){
		n=p;
		m=((__int128)1<<64)/n;
	}
	il ll reduce(ull x){
		ull res=((__int128)x*m)>>64;
		res=x-res*n;
		return (res>=n)?(res-n):res;
	}
	#undef ull
}F;
il void inc(ll &x,ll y){
	((x+=y)>=mod)?(x-=mod):0;
}
il ll C(ll nn,ll mm){
	return F.reduce(jc[nn]*F.reduce(jcinv[mm]*jcinv[nn-mm]));
}
int main(){
	n=read();
	mod=read();
	F.init(mod);
	jc[0]=1;
	fr(i,1,300000) jc[i]=F.reduce(jc[i-1]*i);
	jcinv[300000]=inv(jc[300000],mod);
	pfr(i,299999,0) jcinv[i]=F.reduce(jcinv[i+1]*(i+1));
	fr(i,1,n) fr(j,1,n) f[i][j]=C(n+i*j-1,n);
	fr(i,1,n) fr(j,1,n) fr(k,1,i-1) inc(f[i][j],mod-F.reduce(f[k][j]*C(i,k)));
	fr(i,1,n) fr(j,1,n) fr(k,1,j-1) inc(f[i][j],mod-F.reduce(f[i][k]*C(j,k)));
	fr(i,1,n) fr(j,1,n) fr(k,1,i-1) inc(f[i][j],mod-F.reduce(f[k][j]*C(n-k,i-k)));
	fr(i,1,n) fr(j,1,n) fr(k,1,j-1) inc(f[i][j],mod-F.reduce(f[i][k]*C(n-k,j-k)));
	pfr(i,n,1){
		pfr(j,n,1) writesp(f[i][j]);
		enter;
	}
}