#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}

int mod;
template <class ADD>
inline void add(ADD &x,ADD y){
	x += y;
	if(x >= mod) x -= mod;
}

template <class SUB>
inline void sub(SUB &x,SUB y){
	x -= y;
	if(x < 0) x += mod;
}

ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;
	}
	return ans;
}

__int128 mu;
namespace barrett {
	inline ll reduce(ll x) {
    	ll r = x - (mu * x >> 64) * mod;
    	return r >= mod ? r - mod : r;
    }
  	inline void setmod(ll mod) {
    	mu = -1ull / mod;
  	}
}
using namespace barrett;
int n;

bool _st;

ll fact[305],ifac[305],inv[305],f[305][305][305],g[305][305][305],C[305][305],cof[305][305][305];//i 个点,这一层 j 个点
void init(){
	fact[0] = 1;
	rep(i,1,n) fact[i] = reduce(fact[i - 1] * i);
	ifac[n] = power(fact[n]);
	per(i,n - 1,0) ifac[i] = reduce(ifac[i + 1] * (i + 1));
	rep(i,1,n) inv[i] = reduce(ifac[i] * fact[i - 1]);
	rep(i,0,n){
		C[i][0] = 1;
		rep(j,1,i){
			C[i][j] = C[i - 1][j - 1];
			add(C[i][j],C[i - 1][j]);
		}
	}

	rep(i,0,n){
		rep(j,0,i){
			if(!j) cof[i][j][0] = 1; 
			rep(k,0,n - 1){
				if(j) cof[i][j][k + 1] = reduce(j * cof[i][j - 1][k]);
				add(cof[i][j][k + 1],reduce((i - j) * cof[i][j][k]));
				cof[i][j][k + 1] = reduce(cof[i][j][k + 1] * inv[k + 1]);
			}
		}
	}
}
ll ans[305][305],res[305][305];

bool _ed;

int main(){
//	freopen("test.in","r",stdin);
//	freopen("test.ans","w",stdout);
	cerr << (&_ed - &_st) / 1048576.0 << "\n";
	scanf("%d%d",&n,&mod);
	setmod(mod);
	init();
	cerr << clock() << endl;
	per(v,n,1){	
		add(f[v][1][1],1ll);
		rep(i,1,n){
			rep(j,1,min(i,n / v)){
				rep(k,j,min(n - i,n / v)) add(f[v][i + k][k],reduce(f[v + 1][i][j] * cof[i][j][k]));
			}
		}
	}
	rep(i,1,n) g[1][n][i] = fact[n - 1];
	rep(v,1,n){
		rep(i,1,n){
			rep(j,1,min(i,n / v)){
				rep(k,j,min(n - i,n / v)){
					ll temp = reduce(g[v][i + k][k] * cof[i][j][k]);
					add(g[v + 1][i][j],temp);
					temp = reduce(f[v + 1][i][j] * temp);
					add(res[j][i + j * v],temp);					
					sub(res[k][i + k * v],temp);
				}
			}
		}		
		
		rep(j,1,n / v){
			rep(k,1,n){
				if(k > v) add(res[j][k],res[j - 1][k - v]);
				add(ans[j][k],res[j][k]);
			}
		}
		rep(j,1,n / v) fill(res[j],res[j] + n + 1,0);
	}
	rep(k,1,n){
		ans[k][n] = power(n,n - 2);
		rep(m,1,n - 1) sub(ans[k][n],ans[k][m]);
		rep(m,1,n) printf("%lld ",ans[k][m]);
		printf("\n");
	}
	cerr << clock() << endl;
	return 0; 
}