#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=800;

int f[Maxn+5][Maxn+5],iv[Maxn+5],n,Mod;

inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

// inline int Fac(int x) {int res=1; For(i,1,x) res=1ll*res*i%Mod; return res;}

int main()
{
    // freopen("1.in","r",stdin);

    cin>>n>>Mod; f[1][0]=1;
    For(i,1,n) iv[i]=Pow(i,Mod-2);
    For(i,2,n) For(j,0,i-1)
    {
        f[i][j]=(j==0?1ll:Mod-1ll)*(f[i-j-1][0]+(j+1==i))%Mod*iv[i]%Mod;
        // if(i==3 && j==0) cerr<<f[i][j]*6%Mod<<endl;
        For(k,1,i-j-2) f[i][j]=(f[i][j]+1ll*f[i-k-1][j]*f[k][0]%Mod*iv[i])%Mod;
        // if(i==3 && j==0) cerr<<f[i][j]*6%Mod<<endl;
        For(k,1,i-j-2) f[i][j]=(f[i][j]+1ll*f[k+j][j]*f[i-1][j+k]%Mod*iv[i])%Mod;
        // cerr<<i<<' '<<j<<' '<<1ll*f[i][j]*Fac(i)%Mod<<endl;
    }
    int ans=f[n-1][0];
    For(i,1,n-1) ans=1ll*ans*i%Mod;
    cout<<ans<<endl;
    return 0;
}