/* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //*/ #include // #include // #include using namespace std; // using namespace atcoder; #define DEBUG(x) cerr << #x << ": " << x << endl; #define DEBUG_VEC(v) \ cerr << #v << ":"; \ for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \ cerr << " " << v[iiiiiiii]; \ cerr << endl; #define DEBUG_MAT(v) \ cerr << #v << endl; \ for (int i = 0; i < v.size(); i++) { \ for (int j = 0; j < v[i].size(); j++) { \ cerr << v[i][j] << " "; \ } \ cerr << endl; \ } typedef long long ll; // #define int ll #define vi vector #define vl vector #define vii vector> #define vll vector> #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream &operator<<(ostream &os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #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 rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rrep1(i, n) for (int i = (int)(n); i > 0; i--) #define REP(i, a, b) for (int i = a; i < b; i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(), c.end() void YES(bool t = true) { cout << (t ? "YES" : "NO") << endl; } void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; } void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; } void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; } void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; } void no(bool t = true) { cout << (t ? "no" : "yes") << endl; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; int popcount(ll t) { return __builtin_popcountll(t); } // int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; // int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0}; // vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 }; struct Setup_io { Setup_io() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cout << fixed << setprecision(25); } } setup_io; // const ll MOD = 1000000007; // const ll MOD = 998244353; // #define mp make_pair //#define endl '\n' ll MOD; const int MAXN = 555555; vl fact(MAXN); vl rfact(MAXN); ll mod_pow(ll x, ll p, ll M = MOD) { if (p < 0) { x = mod_pow(x, M - 2, M); p = -p; } x %= M; ll a = 1; while (p) { if (p % 2) a = a * x % M; x = x * x % M; p /= 2; } return a; } ll mod_inverse(ll a, ll M = MOD) { return mod_pow(a, M - 2, M); } void set_fact(ll n, ll M = MOD) { fact[0] = 1; for (ll i = 1; i <= n; i++) { fact[i] = i * fact[i - 1] % M; } rfact[n] = mod_inverse(fact[n], M); for (ll i = n - 1; i >= 0; i--) { rfact[i] = (i + 1) * rfact[i + 1] % M; } } //http://drken1215.hatenablog.com/entry/2018/06/08/210000 //n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ‚��ď����Ă��� ll nCr(ll n, ll r, ll M = MOD) { if (r > n) return 0; assert(fact[2] == 2); ll ret = fact[n]; if (rfact[r] == 0) { rfact[r] = mod_inverse(fact[r], M); } ret = (ret * rfact[r]) % M; if (rfact[n - r] == 0) { rfact[n - r] = mod_inverse(fact[n - r], M); } ret = (ret * rfact[n - r]) % M; return ret; } ll nHr(ll n, ll r) { return nCr(n + r - 1, r); } signed main() { int n; cin >> n >> MOD; set_fact(1000); vll dp(n + 1, vl(n + 1)); dp[0][0] = 1; rep(i, n) { rep(j, n + 1) { if (dp[i][j] == 0) continue; for (int k = 1; i + k <= n; k++) { int ni = i + k; ll pa = mod_pow(k, k - 2); ll choi = nCr(n - i - 1, k - 1); (dp[ni][j + k - 1] += dp[i][j] * pa % MOD * choi) %= MOD; } } } rep(j, n) { cout << dp[n][j] << endl; } }