#line 1 "7759.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")
#line 2 "/mnt/c/Users/tsigm/Documents/Cprogram/library/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
if(x<y){ x=y; return true; }
return false;
}
template<class T,class U> bool chmin(T& x, U y){
if(y<x){ x=y; return true; }
return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
o<<"{";
for(const T& v:vc) o<<v<<",";
o<<"}";
return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
os<<t<<" ~ ";
dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {"; \
for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif
template<class D> D divFloor(D a, D b){
return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
/*
x 0 1 2 3 4 5 6 7 8 9
bsr(x) -1 0 1 1 2 2 2 2 3 3
最上位bit
*/
int bsr(int x){
return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(uint x){
return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(ll x){
return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}
int bsr(ull x){
return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}
/*
x 0 1 2 3 4 5 6 7 8 9
bsl(x) -1 0 1 0 2 0 1 0 3 0
最下位bit
*/
int bsl(int x){
if(x==0) return -1;
return __builtin_ctz(x);
}
int bsl(uint x){
if(x==0) return -1;
return __builtin_ctz(x);
}
int bsl(ll x){
if(x==0) return -1;
return __builtin_ctzll(x);
}
int bsl(ull x){
if(x==0) return -1;
return __builtin_ctzll(x);
}
template<class T>
T rnd(T l,T r){ //[l,r)
using D = uniform_int_distribution<T>;
static random_device rd;
static mt19937 gen(rd());
return D(l,r-1)(gen);
}
template<class T>
T rnd(T n){ //[0,n)
return rnd(T(0),n);
}
#line 5 "7759.cpp"
#include <atcoder/modint>
using namespace atcoder;
using mint = modint;
V<mint> fact,ifact,invs;
mint Choose(int a,int b){
// a * .. * (a-b+1) / b!
if(b<0) return 0;
if(a-b+1 > 0) return fact[a] * ifact[b] * ifact[a-b];
if(a < 0) return fact[-(a-b+1)] * ifact[b] * ifact[-a-1] * (b&1 ? -1 : 1);
return 0;
}
void InitFact(int N){ //[0,N]
N++;
fact.resize(N);
ifact.resize(N);
invs.resize(N);
fact[0] = 1;
rep1(i,N-1) fact[i] = fact[i-1] * i;
ifact[N-1] = fact[N-1].inv();
for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}
// https://qoj.ac/contest/1415/problem/7759
int main(){
cin.tie(0);
ios::sync_with_stdio(false); //DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int N,mod; cin >> N >> mod;
mint::set_mod(mod);
// int N; cin >> N;
InitFact(1000000);
VV<mint> g(N+1,V<mint>(N+1));
// rep1(b,N){
// // V<mint> fb(N+1); rep1(i,N) fb[i] = Choose(b-1+i,i);
// // g[a][b] = [x^N]fb^a
// // { // slow
// // V<mint> dp = fb;
// // rep1(a,N){
// // g[a][b] = dp[N];
// // per1(j,N) if(dp[j]){
// // rep1(i,N-j) dp[j+i] += dp[j] * fb[i];
// // dp[j] = 0;
// // }
// // }
// // }
// /*
// fb = \sum_{i=1}^{inf} C(b-1+i,i)x^i
// = (1-x)^(-b) - 1
// */
// rep1(a,N){
// mint gab = 0;
// rep(i,a+1){
// // Choose(a,i) * (-1)^(a-i) Choose(-b*i,N) * (-1)^N
// g[a][b] += Choose(a,i) * Choose(-b*i,N) * ((a-i+N)&1 ? -1 : 1);
// }
// }
// }
rep1(a,N) rep1(b,N){
rep(i,a+1){
mint tmp = Choose(a,i) * Choose(-b*i,N);
if((a-i+N)&1) tmp = -tmp;
g[a][b] += tmp;
}
}
// g[a][b]: a block * b (possibly empty) block
rep1(a,N){
V<mint> f(N+1);
rep1(k,N){
rep1(i,k){
mint tmp = g[a][i] * Choose(k,i);
if((k-i)&1) f[k] -= tmp;
else f[k] += tmp;
}
}
g[a] = f;
}
// return 0;
// rep1(i,N){
// rep1(j,N) cout << g[i][j] << " ";
// cout << endl;
// }
{
VV<mint> f(N,V<mint>(N));
rep(i,N) rep(j,N) f[i][j] = g[i+1][j+1];
g = f;
}
rep(_,2){
rep(a,N){
V<mint> alpha(N);
rep(i,N) alpha[i] = g[a][i] / Choose(N-1,i);
V<mint> beta(N);
rep(k,N){
rep(i,k+1) beta[k] += alpha[i] * Choose(k,i) * ((k-i)&1 ? -1 : 1);
}
rep(b,N) g[a][b] = beta[b] * Choose(N-1,b);
}
rep(i,N) rep(j,i) swap(g[i][j],g[j][i]);
}
// return 0;
rep(i,N){
rep(j,N) cout << g[i][j].val() << " ";
cout << endl;
}
}