#include<bits/stdc++.h>
using namespace std;
template<typename T>
void read(T &a){
    #define gc getchar()
    char c;a=0;int f=1;
    while(!isdigit(c=gc))if(c=='-')f=-1;
    do a=a*10+c-'0';
    while(isdigit(c=gc));
    a*=f;
}
template<typename T>
void write(T a){
    if(a<0)putchar('-'),a=-a;
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> PII;
typedef pair<ll,int> PLI;
mt19937 eg;
int n,P;
const int MAXN=810;
ll inv[MAXN];
ll f[MAXN][MAXN];
void madd(ll &x,ll y){x=(x+y)%P;}
int main(){
    // freopen("2.in","r",stdin);
    eg.seed(chrono::system_clock::now().time_since_epoch().count());
    cin>>n>>P;
    inv[1]=1;
    for(int i=2;i<=800;++i)inv[i]=P-inv[P%i]*(P/i)%P;
    f[0][0]=1;
    // for(int i=1;i<=n;++i)f[0][i]=-1;
    for(int i=1;i<=n-1;++i){
        for(int j=0;j<=n-i;++j){
            madd(f[i][j],f[i-1][0]);
            for(int k=2;k<=i-1;++k){
                madd(f[i][j],(f[k-1][0]-f[k-1][i-k+j])*f[i-k][j]);
            }
            f[i][j]=f[i][j]*inv[i+j]%P;
            // printf("f[%d][%d]=%lld\n",i,j,f[i][j]);
        }
    }
    ll res=f[n-1][0];
    for(int i=1;i<=n-1;++i)res=res*i%P;
    cout<<(res+P)%P<<'\n';
    return 0;
}