// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#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
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

int mod;
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(){mod=read(),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);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 1000005
#define inf 0x3f3f3f3f

int n;
modint f[505][505],res[505][505],ans[505][505];

modint F(int n,int m){
	// n balls , m pockets
	return C(n+m-1,m-1);
}

void work(int t){
//	memset(f,0,sizeof f);
//	f[0][0]=1;
//	For(i,1,n){
//		For(j,0,n-1)
//			if(f[i-1][j].x){
//				For(k,1,n-j)
//					f[i][j+k]+=f[i-1][j]*F(k,t);
//			}
//		res[t][i]=f[i][n];
//	}
	For(i,1,n)
		res[t][i]=F(n,t*i);
}

signed main()
{
	n=read(),initmod(); initC(505);
	For(i,1,n)work(i);
	For(t,1,n){
		Rep(i,n,1)
			For(j,1,i-1)
				res[i][t]+=res[j][t]*C(i,j)*sign(i-j);
	}
	For(t,1,n){
		Rep(i,n,1)
			For(j,1,i-1)
				res[t][i]+=res[t][j]*C(i,j)*sign(i-j);
	}
//	For(t,1,n){
//		For(i,1,n)cout<<res[i][t].x<<" ";
//		cout<<"\n";
//	}
	For(i,1,n)For(j,1,n)ans[n-i][n-j]=res[i][j];
	For(t,0,n-1){
		For(i,0,n-1)
			For(j,i+1,n)
				ans[t][i]+=ans[t][j]*C(j,i)*sign(j-i);
	}
	For(t,0,n-1){
		For(i,0,n-1)
			For(j,i+1,n)
				ans[i][t]+=ans[j][t]*C(j,i)*sign(j-i);
	}
//	memset(res,0,sizeof res);
//	For(i,0,n-1)
//		For(j,0,n-1)
//			For(ii,i,)For(jj,0,j)
//				res[i][j]+=ans[ii][jj]*C(i,ii)*C(j,jj)*sign(i-ii+j-jj);
	For(t,0,n-1){
		For(i,0,n-1)cout<<ans[i][t].x<<" ";
		cout<<"\n";
	}
	return 0;
}
/*
200 1000000007
1 0 0
1 2 3
*/