#include<stdio.h>
#include<algorithm>
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __uint128_t ulll;
uint inv[805],dp[805][805];
int main() {
    int n;uint mod;
    scanf("%d%u",&n,&mod),--n;
    const uint len(std::__lg(mod-1)+1);
    const ull mul(((ulll(1)<<63+len)-1)/mod+1);
    const auto divide([&](const ull &x)->ull {
        return ulll(x)*mul>>63+len;
    });
    const auto reduce([&](const ull &x)->uint {
        return x-divide(x)*mod;
    });
    inv[0]=0,inv[1]=1;
    for(int i=2;i<=n;i++) {
        const int j(mod/i+1);
        inv[i]=reduce(ull(j)*inv[i*j-mod]);
    }
    for(int i=0;i<=n;i++) {
        dp[0][i]=1;
        dp[1][i]=inv[i+1];
    }
    for(int i=2;i<=n;i++) {
        for(int j=0;i+j<=n;j++) {
            dp[i][j]=reduce(dp[i][j]+ull(dp[0][j])*dp[i-1][0]);
            for(int k=1;k<i-1;k++) {
                dp[i][j]=reduce(dp[i][j]+ull(dp[k][j])*(dp[i-k-1][0]+mod-dp[i-k-1][j+k]));
            }
            dp[i][j]=reduce(ull(dp[i][j])*inv[i+j]%mod);
        }
    }
    uint ans(dp[n][0]);
    for(int i=1;i<=n;i++) {
        ans=reduce(ull(ans)*i);
    }
    printf("%u\n",ans);
    return 0;
}