/*
	Luogu name: Symbolize
	Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=8e2+10;
const int inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int n,mod,f[N][N];
int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
int power(int a,int b,int p)
{
	int ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%p;
		a=a*a%p;
		b>>=1;
	}
	return ans;
}
signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	mod=read();
	f[1][0]=1;
	rep1(i,2,n)
	{
		rep1(j,0,n-i)
		{
			f[i][j]=f[i-1][0];
			rep1(k,2,i-1) f[i][j]=(f[i][j]+f[i-k][j]*((f[k][0]-f[k][i-1-k+j]+mod)%mod)%mod)%mod;
			f[i][j]=f[i][j]*power(i+j-1,mod-2,mod)%mod;
		}
	}
	int ans=f[n][0];
	rep1(i,1,n-1) ans=ans*i%mod;
	cout<<ans<<"\n";
	return 0;
}