#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
int mod=998244353;
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%m;x=1ll*x*x%m;}
	return res;
}
inline void Ad(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
inline void Mi(int &x,int y){x=x-y<0?x-y+mod:x-y;}
const int N=802;
int n;
int f[N][N],g[N],fac[N],iv[N];
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read(),mod=read();
	fac[0]=1;rep(i,1,n)fac[i]=1ll*fac[i-1]*i%mod;
	iv[1]=1;rep(i,2,n)iv[i]=1ll*iv[mod%i]*(mod-mod/i)%mod;
	g[1]=1;
	rep(i,1,n-1){
		Ad(f[i][0],g[i]);
		Ad(g[i+1],1ll*f[i][0]*iv[i+1]%mod);
		rep(j,0,i-1)rep(k,2,min(i,n-i))Ad(f[i+k][j],1ll*f[i][j]*g[k]%mod*k%mod*iv[i+k]%mod);
		rep(j,0,i-1)rep(k,1,min(i,n-i))Mi(f[i+k][j+1],1ll*f[i][j]*g[k]%mod*k%mod*iv[i+k]%mod);
		if(i>1)rep(k,1,min(i-1,n-i))rep(j,0,k-1)Ad(f[i+k][j],1ll*g[i]*f[k][j]%mod*i%mod*iv[i+k]%mod);
		rep(k,1,min(i-1,n-i))rep(j,0,k-1)Mi(f[i+k][j+1],1ll*g[i]*f[k][j]%mod*i%mod*iv[i+k]%mod);
		rep(j,1,i-1)Ad(f[i+1][j-1],1ll*f[i][j]*iv[i+1]%mod);
	}
	cout<<1ll*g[n]*fac[n]%mod<<"\n";
	//rep(i,1,n)printf("%lld\n",1ll*g[i]*fac[i]%mod);
    return 0;
}