#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=500+5,M=5e5+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,k,p;
ll ans[N][N],C[N][N],frc[N*N],inv[N*N],f[N][N];
ll choose(int x,int y){return frc[x]*inv[y]%p*inv[x-y]%p;}
int main(){
	int i,j,h;scanf("%d%d",&n,&p);
	for(i=0;i<=n;i++) {
		for(C[i][0]=j=1;j<=i;j++) C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
	}
	inv[1]=1;for(i=2;i<=n*n+n;i++) inv[i]=(p-inv[p%i])*(p/i)%p;
	for(frc[0]=inv[0]=i=1;i<=n*n+n;i++) frc[i]=frc[i-1]*i%p,inv[i]=inv[i-1]*inv[i]%p;
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++) f[i][j]=choose(i*j+n-1,i*j-1);
	}
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++) for(h=1;h<i;h++) f[i][j]=(f[i][j]+(p-f[h][j])*C[i][h])%p;
	}
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++) for(h=1;h<j;h++) f[i][j]=(f[i][j]+(p-f[i][h])*C[j][h])%p;
	}
	for(i=1;i<=n;i++) for(j=1;j<=n;j++) ans[n-i][n-j]=f[i][j];
	for(i=0;i<n;i++){
		for(j=n-1;~j;j--) for(h=j+1;h<n;h++) ans[i][j]=(ans[i][j]+(p-ans[i][h])*C[h][j])%p;
	}
	for(i=n-1;~i;i--){
		for(j=0;j<n;j++) for(h=i+1;h<n;h++) ans[i][j]=(ans[i][j]+(p-ans[h][j])*C[h][i])%p;
	}
	for(i=0;i<n;i++) for(j=0;j<n;j++) printf("%lld%c",ans[i][j]," \n"[j==n-1]);
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}