#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=502;
int n,mod,C[N*N][N];
ll f1[N][N],f2[N][N],f3[N][N],f[N][N],g[N][N],h[N][N];
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>mod;
	For(i,0,n*n+n){
		For(j,0,min(n,i)){
			C[i][j]=j?(C[i-1][j]+C[i-1][j-1])%mod:1;
		}
	}
	For(i,0,n){
		For(j,0,n){
			f1[i][j]=C[n+i*j-1][n];
		}
	}
	For(i,1,n){
		For(j,1,n){
			For(k,0,j){
				(f2[i][j]+=C[j][k]*((j-k)%2?-1:1)*f1[i][k])%=mod;
			}
		}
	}
	For(i,1,n){
		For(j,1,n){
			For(k,0,i){
				(f3[i][j]+=C[i][k]*((i-k)%2?-1:1)*f2[k][j])%=mod;
			}
		}
	}
	For(a,0,n-1){
		For(b,0,n-1){
			f[a][b]=f3[n-a][n-b];
		}
	}
	For(a,0,n-1){
		For(b,0,n-1){
			For(i,b,n-1){
				(g[a][b]+=f[a][i]*((i-b)%2?-1:1)*C[i][b])%=mod;
			}
		}
	}
	For(a,0,n-1){
		For(b,0,n-1){
			For(i,a,n-1){
				(h[a][b]+=g[i][b]*((i-a)%2?-1:1)*C[i][a])%=mod;
			}
			cout<<(h[a][b]%mod+mod)%mod<<" \n"[b==n-1];
		}
	}
	return 0;
}