#include<bits/stdc++.h>
using namespace std;
const int N=1e6;
int n;
int mod;
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
typedef unsigned long long ull;
namespace FM{
	typedef __uint128_t L;
	struct FastMod{
		ull b,m;
		FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){}
		ull reduce(ull a){ull q=(ull)((L(m)*a)>>64),r=a-q*b;return r>=b?r-b:r;}
	};
	FastMod F(2);
}
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=FM::F.reduce(1ull*x*o.x),*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}
void initmod(){scanf("%d",&mod),FM::F=FM::FastMod(mod);}
vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}
////////////////////////////////////////////////////////////////////////////////
modint f[510][510],g[510][510],dp[510][510],h[510][510],fz[510][510],O[510][510];
int main(){
	scanf("%d",&n);initmod();
	initC(1000000);
	//freopen("b.out","w",stdout);
    O[0][0]=1;
    for(int i=1;i<=n;i++){
        O[i][0]=1;
        for(int j=1;j<=i;j++)O[i][j]=O[i-1][j-1]+O[i-1][j];
    }
	for(int d=1;d<=n;d++){
		for(int i=1;i<=n;i++)for(int j=0;j<i;j++)
		f[i][d]+=sign(j)*O[i][j]*C(n+(i-j)*d-1,(i-j)*d-1);
	}
	for(int a=1;a<=n;a++)for(int b=1;b<=n;b++)for(int c=0;c<b;c++)
	g[n-a][n-b]+=sign(c)*f[a][b-c]*O[b][c];
	for(int a=0;a<n;a++)for(int b=a;b<n;b++)for(int d=0;d<n;d++)
	fz[a][d]+=sign(b-a)*g[b][d]*O[b][a];
	for(int a=0;a<n;a++)for(int c=0;c<n;c++)for(int d=c;d<n;d++)
	h[a][c]+=sign(d-c)*fz[a][d]*O[d][c];
	/*for(int a=0;a<n;a++)for(int b=a;b<n;b++)for(int c=0;c<n;c++)for(int d=c;d<n;d++)
	(h[a][c]+=(((b-a+d-c)&1)?-1ll:1ll)*g[b][d]*C(b,a)%mod*C(d,c)%mod)%=mod;*/
	for(int a=0;a<n;a++)for(int c=0;c<n;c++)printf("%d%c",h[a][c].x,(c==n-1)?'\n':' ');
	return 0;
}