#include <bits/stdc++.h>
using namespace std;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, Mod; cin >> n >> Mod; vector<int> iv(n);
    vector<vector<int>> f(n + 1, vector<int>(n));
    const auto &mt = [&](int x) { return x < 0 ? x + Mod : x; };
    f[1][0] = 1, iv[1] = 1; long long fac = 1;
    for(int i = 2; i < n; ++i) fac = fac * i % Mod,
        iv[i] = 1ll * (Mod - Mod / i) * iv[Mod % i] % Mod;
    for(int i = 2; i <= n; ++i)
        for(int j = 0; i + j <= n; ++j) {
            __int128_t ret = f[i - 1][0];
            for(int k = 2; k < i - 1; ++k)
                ret += 1ll * (f[k][0] - f[k][i + j - 1 - k]) * f[i - k][j];
            f[i][j] = mt((int)(ret * iv[i + j - 1] % Mod));
        }
    printf("%d", (int)(f[n][0] * fac % Mod));
}