#include <bits/stdc++.h>
using namespace std;
typedef uint64_t u64;
typedef __uint128_t u128;
const int N = 805;
int n, mod, f[N][N][2], inv[N], ans;
struct fastmod 
{
    int m; 
    u64 b;
    fastmod() {}
    fastmod(int m): m(m), b(((u128)1 << 64) / m) {}
    int reduce(u64 a) 
    {
        int r = a - ((u128)a * b >> 64) * m;
        return r < m ? r: r - m;
    }
}z;
int main()
{
    scanf("%d%d", &n, &mod); z = mod; inv[1] = 1; f[1][0][0] = 1;
    for(int i = 2; i <= n; i++) inv[i] = z.reduce((u64)(mod - mod / i) * inv[mod % i]);
    for(int i = 2; i <= n; i++) 
    {
        f[i][i - 1][0] = inv[i];
        for(int j = i - 1; j >= 1; j--) 
        {
            if(!(f[i][j][0] + f[i][j][1])) continue;
            for(int k = 1; k <= j; k++) 
            {
                if(k == j) f[i][0][0] = z.reduce(f[i][0][0] + (u64)(f[i][j][0] + f[i][j][1]) * f[j][0][0]);
                else if(k >= 2) 
                {
                    f[i][j - k][0] = z.reduce(f[i][j - k][0] + (u64)(f[i][j][0] + f[i][j][1]) * z.reduce((u64)f[k][0][0] * z.reduce((u64)inv[j] * k)));
                    f[i][j - k][1] = z.reduce(f[i][j - k][1] + (u64)(f[i][j][0] + f[i][j][1]) * (mod - f[j][j - k][0] + z.reduce((u64)(f[j][j - k + 1][0] + f[j][j - k + 1][1]) * (mod - inv[j - k + 1]))));
                }
            }
        }
    }
    ans = f[n][0][0];
    for(int i = 1; i <= n; i++) ans = z.reduce((u64)ans * i);
    printf("%d\n", ans);
    return 0;
}