#include<bits/stdc++.h>
using namespace std;
const int N = 880;
int n,mod;
int inv[N];
int dp[N][N],f[N];//点数,层数 
int main()
{
	cin>>n>>mod;
	inv[1]=1;
	for(int i=2;i<=n;i++)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
	dp[1][0]=1;
	for(int i=2;i<=n;i++)
	for(int j=0;j<=i;j++)
	{
		dp[i][j]=(dp[i][j]+1ll*dp[i-1][j+1]*inv[i]%mod)%mod;
		if(j==0)dp[i][0]=(dp[i][0]+1ll*dp[i-1][0]*inv[i]%mod)%mod;
		for(int k=1;k<i;k++)
		{
			dp[i][j]=(dp[i][j]+1ll*dp[i-k][j]*dp[k-1][0]%mod*inv[i]%mod)%mod;
			if(j)dp[i][j]=(dp[i][j]-1ll*dp[i-k][j-1]*(dp[k-1][0]+(k==1))%mod*inv[i]%mod)%mod;
		}
	} 
	int ans=1ll*dp[n-1][0]*inv[n]%mod;
	for(int i=1;i<=n;i++)ans=1ll*ans*i%mod;
	cout<<ans;
	return 0;
}