#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define randfind(l,r) (rnd()%((r)-(l)+1)+(l))
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int Maxn=8e2+10;
int mod;
inline int ksm(int x,int y){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }
    return sum;
}
int n;
inline void init(){
    n=read();mod=read();
}
int inv[Maxn];
inline int getfac(int x){
    int sum=1;
    fr(i,1,x) sum=1ll*sum*i%mod;
    return sum;
}
int f[Maxn][Maxn];
inline void add(int &x,int y){
    x+=y;if(x>=mod) x-=mod;
}
inline void work(){
    inv[0]=1;
    fr(i,1,n) inv[i]=ksm(i,mod-2);
    // cout<<ksm(2,mod-2)<<endl;
    f[1][0]=1;
    fr(i,2,n) fr(j,0,i){
        f[i][j]=1ll*f[i-1][j+1]*inv[i]%mod;
        if(j==0) add(f[i][j],1ll*f[i-1][j]*inv[i]%mod);
        fr(k,1,i-j){
            add(f[i][j],1ll*f[i-k][j]*f[k-1][0]%mod*inv[i]%mod);
            if(j) add(f[i][j],mod-1ll*f[i-k][j-1]*(f[k-1][0]+(k==1))%mod*inv[i]%mod);
        }
    }
    int ans=0;
    // fr(i,1,n) fr(j,0,n) cout<<i<<' '<<j<<' '<<f[i][j]<<endl;
    // cout<<getfac(n)<<endl;
    writeln(1ll*f[n-1][0]*getfac(n-1)%mod);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}