#line 1 "A.cpp" // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using ull = unsigned long long; template using pq = priority_queue; template using qp = priority_queue, greater>; #define vec(T, A, ...) vector A(__VA_ARGS__); #define vvec(T, A, h, ...) vector> A(h, vector(__VA_ARGS__)); #define vvvec(T, A, h1, h2, ...) vector>> A(h1, vector>(h2, vector(__VA_ARGS__))); #define endl "\n" #define spa ' ' #define len(A) A.size() #define all(A) begin(A), end(A) #define fori1(a) for(ll _ = 0; _ < (a); _++) #define fori2(i, a) for(ll i = 0; i < (a); i++) #define fori3(i, a, b) for(ll i = (a); i < (b); i++) #define fori4(i, a, b, c) for(ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c)) #define overload4(a, b, c, d, e, ...) e #define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__) template vector> ENUMERATE(vector &A, ll s = 0){ vector> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } vector> ENUMERATE(string &A, ll s = 0){ vector> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } #define enum1(A) fori(A.size()) #define enum2(a, A) for(auto a:A) #define enum3(i, a, A) for(auto&& [i, a]: ENUMERATE(A)) #define enum4(i, a, A, s) for(auto&& [i, a]: ENUMERATE(A, s)) #define enum(...) overload4(__VA_ARGS__, enum4, enum3, enum2, enum1)(__VA_ARGS__) template vector> ZIP(vector &A, vector &B){ int n = min(A.size(), B.size()); vector> ret(n); for(int i = 0; i < n; i++) ret[i] = {A[i], B[i]}; return ret; } template vector> ENUMZIP(vector &A, vector &B, ll s = 0){ int n = min(A.size(), B.size()); vector> ret(n); for(int i = 0; i < n; i++) ret[i] = {i + s, A[i], B[i]}; return ret; } #define zip4(a, b, A, B) for(auto&& [a, b]: ZIP(A, B)) #define enumzip5(i, a, b, A, B) for(auto&& [i, a, b]: ENUMZIP(A, B)) #define enumzip6(i, a, b, A, B, s) for(auto&& [i, a, b]: ENUMZIP(A, B, s)) #define overload6(a, b, c, d, e, f, g, ...) g #define zip(...) overload6(__VA_ARGS__, enumzip6, enumzip5, zip4, _, _, _)(__VA_ARGS__) vector stoc(string &S){ int n = S.size(); vector ret(n); for(int i = 0; i < n; i++) ret[i] = S[i]; return ret; } #define INT(...) int __VA_ARGS__; inp(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__); #define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__); #define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__); #define VEC(T, A, n) vector A(n); inp(A); #define VVEC(T, A, n, m) vector> A(n, vector(m)); inp(A); const ll MOD1 = 1000000007; const ll MOD9 = 998244353; template auto min(const T& a){ return *min_element(all(a)); } template auto max(const T& a){ return *max_element(all(a)); } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } void FLUSH(){cout << flush;} void print(){cout << endl;} template void print(Head &&head, Tail &&... tail) { cout << head; if (sizeof...(Tail)) cout << spa; print(forward(tail)...); } template void print(vector &A){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i == n - 1) cout << endl; else cout << spa; } } template void print(vector> &A){ for(auto &row: A) print(row); } template void print(pair &A){ cout << A.first << spa << A.second << endl; } template void print(vector> &A){ for(auto &row: A) print(row); } template void prisep(vector &A, S sep){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i == n - 1) cout << endl; else cout << sep; } } template void priend(T A, S end){ cout << A << end; } template void priend(T A){ priend(A, spa); } template void inp(T&... a){ (cin >> ... >> a); } template void inp(vector &A){ for(auto &a:A) cin >> a; } template void inp(vector> &A){ for(auto &row:A) inp(row); } template void inp(pair &A){ inp(A.first, A.second); } template void inp(vector> &A){ for(auto &row: A) inp(row.first, row.second); } template T sum(vector &A){ T tot = 0; for(auto a:A) tot += a; return tot; } template pair, map> compression(vector X){ sort(all(X)); X.erase(unique(all(X)), X.end()); map mp; for(int i = 0; i < X.size(); i++) mp[X[i]] = i; return {X, mp}; } #line 2 "Library/C++/math/modinv.hpp" template T modinv(T a, T MOD){ T b = MOD; T u = 1; T v = 0; while(b > 0){ T t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } if(a != 1) return -1; if(u < 0) u += MOD; return u; } #line 3 "Library/C++/math/Combination.hpp" template struct Combination{ int N; vector fact, invfact; Combination(int N) : N(N){ fact.resize(N + 1); invfact.resize(N + 1); fact[0] = 1; for(int i = 1; i <= N; i++){ fact[i] = fact[i - 1] * i; } invfact[N] = T(1) / fact[N]; for(int i = N - 1; i >= 0; i--){ invfact[i] = invfact[i + 1] * (i + 1); } } T nCk(int n, int k){ assert(0 <= n && n <= N); if(k > n || k < 0) return T(0); return fact[n] * invfact[k] * invfact[n - k]; } T nPk(int n, int k){ assert(0 <= n && n <= N); if(k > n || k < 0) return T(0); return fact[n] * invfact[n - k]; } T nHk(int n, int k){ if(n == 0 && k == 0) return T(1); return nCk(n + k - 1, k); } }; #line 2 "Library/C++/other/Modint.hpp" template struct Modint{ int x; Modint() : x(0){} Modint(int64_t y){ if(y >= 0) x = y % MOD; else x = (y % MOD + MOD) % MOD; } Modint &operator+=(const Modint &p){ x += p.x; if(x >= MOD) x -= MOD; return *this; } Modint &operator-=(const Modint &p){ x -= p.x; if(x < 0) x += MOD; return *this; } Modint &operator*=(const Modint &p){ x = int(1LL * x * p.x % MOD); return *this; } Modint &operator/=(const Modint &p){ *this *= p.inverse(); return *this; } Modint &operator%=(const Modint &p){ assert(p.x == 0); return *this; } Modint operator-() const{ return Modint(-x); } Modint& operator++() { x++; if (x == MOD) x = 0; return *this; } Modint& operator--() { if (x == 0) x = MOD; x--; return *this; } Modint operator++(int) { Modint result = *this; ++*this; return result; } Modint operator--(int) { Modint result = *this; --*this; return result; } friend Modint operator+(const Modint &lhs, const Modint &rhs){ return Modint(lhs) += rhs; } friend Modint operator-(const Modint &lhs, const Modint &rhs){ return Modint(lhs) -= rhs; } friend Modint operator*(const Modint &lhs, const Modint &rhs){ return Modint(lhs) *= rhs; } friend Modint operator/(const Modint &lhs, const Modint &rhs){ return Modint(lhs) /= rhs; } friend Modint operator%(const Modint &lhs, const Modint &rhs){ assert(rhs.x == 0); return Modint(lhs); } bool operator==(const Modint &p) const{ return x == p.x; } bool operator!=(const Modint &p) const{ return x != p.x; } bool operator<(const Modint &rhs) { return x < rhs.x; } bool operator<=(const Modint &rhs) { return x <= rhs.x; } bool operator>(const Modint &rhs) { return x > rhs.x; } bool operator>=(const Modint &rhs) { return x >= rhs.x; } Modint inverse() const{ int a = x, b = MOD, u = 1, v = 0, t; while(b > 0){ t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } return Modint(u); } Modint pow(int64_t k) const{ Modint ret(1); Modint y(x); while(k > 0){ if(k & 1) ret *= y; y *= y; k >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const Modint &p){ return os << p.x; } friend istream &operator>>(istream &is, Modint &p){ int64_t y; is >> y; p = Modint(y); return (is); } static int get_mod(){ return MOD; } }; struct Arbitrary_Modint{ int x; static int MOD; static void set_mod(int mod){ MOD = mod; } Arbitrary_Modint() : x(0){} Arbitrary_Modint(int64_t y){ if(y >= 0) x = y % MOD; else x = (y % MOD + MOD) % MOD; } Arbitrary_Modint &operator+=(const Arbitrary_Modint &p){ x += p.x; if(x >= MOD) x -= MOD; return *this; } Arbitrary_Modint &operator-=(const Arbitrary_Modint &p){ x -= p.x; if(x < 0) x += MOD; return *this; } Arbitrary_Modint &operator*=(const Arbitrary_Modint &p){ x = int(1LL * x * p.x % MOD); return *this; } Arbitrary_Modint &operator/=(const Arbitrary_Modint &p){ *this *= p.inverse(); return *this; } Arbitrary_Modint &operator%=(const Arbitrary_Modint &p){ assert(p.x == 0); return *this; } Arbitrary_Modint operator-() const{ return Arbitrary_Modint(-x); } Arbitrary_Modint& operator++() { x++; if (x == MOD) x = 0; return *this; } Arbitrary_Modint& operator--() { if (x == 0) x = MOD; x--; return *this; } Arbitrary_Modint operator++(int) { Arbitrary_Modint result = *this; ++*this; return result; } Arbitrary_Modint operator--(int) { Arbitrary_Modint result = *this; --*this; return result; } friend Arbitrary_Modint operator+(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs){ return Arbitrary_Modint(lhs) += rhs; } friend Arbitrary_Modint operator-(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs){ return Arbitrary_Modint(lhs) -= rhs; } friend Arbitrary_Modint operator*(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs){ return Arbitrary_Modint(lhs) *= rhs; } friend Arbitrary_Modint operator/(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs){ return Arbitrary_Modint(lhs) /= rhs; } friend Arbitrary_Modint operator%(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs){ assert(rhs.x == 0); return Arbitrary_Modint(lhs); } bool operator==(const Arbitrary_Modint &p) const{ return x == p.x; } bool operator!=(const Arbitrary_Modint &p) const{ return x != p.x; } bool operator<(const Arbitrary_Modint &rhs) { return x < rhs.x; } bool operator<=(const Arbitrary_Modint &rhs) { return x <= rhs.x; } bool operator>(const Arbitrary_Modint &rhs) { return x > rhs.x; } bool operator>=(const Arbitrary_Modint &rhs) { return x >= rhs.x; } Arbitrary_Modint inverse() const{ int a = x, b = MOD, u = 1, v = 0, t; while(b > 0){ t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } return Arbitrary_Modint(u); } Arbitrary_Modint pow(int64_t k) const{ Arbitrary_Modint ret(1); Arbitrary_Modint y(x); while(k > 0){ if(k & 1) ret *= y; y *= y; k >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const Arbitrary_Modint &p){ return os << p.x; } friend istream &operator>>(istream &is, Arbitrary_Modint &p){ int64_t y; is >> y; p = Arbitrary_Modint(y); return (is); } static int get_mod(){ return MOD; } }; int Arbitrary_Modint::MOD = 998244353; using modint9 = Modint<998244353>; using modint1 = Modint<1000000007>; using modint = Arbitrary_Modint; #line 187 "A.cpp" using mint = modint; void solve(){ INT(n, MOD); mint::set_mod(MOD); Combination C(1000); vec(mint, tree, n + 1); tree[0] = 1; tree[1] = 1; fori(i, 2, n + 1) tree[i] = mint(i).pow(i - 2); vvec(mint, dp, n + 1, n, 0); dp[0][0] = 1; fori(i, n) fori(j, i + 1) fori(k, 1, n - i + 1){ mint times = C.nCk(n - i - 1, k - 1); dp[i + k][j + k - 1] += dp[i][j] * times * tree[k]; } prisep(dp[n], endl); } int main(){ cin.tie(0)->sync_with_stdio(0); cout << fixed << setprecision(12); int t; t = 1; // cin >> t; while(t--) solve(); return 0; }