// created:  Jun/16/2024 20:39:51
#include<cstdio>
#include<cctype>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
typedef __uint128_t u128;
struct barrett
{
	ull mod,inv;
	void init(int mod_){inv=(-1ull)/(mod=mod_);}
	int operator()(ull x)
	{
		x-=(ull)((u128)x*inv>>64)*mod;
		if(x>>63)x+=mod;
		return (int)x;
	}
};
constexpr int N=805;
int mod;barrett bar;
void reduce(int &x){(x>=mod)&&(x-=mod);}
void reduce_(int &x){(x<0)&&(x+=mod);}
int n,inv[N],f[N],g[N][N];
int main()
{
	read(n,mod);bar.init(mod);
	inv[1]=1;
	F(i,2,n+1)inv[i]=bar((ull)(mod-mod/i)*inv[mod%i]);
	F(i,1,n+1)
	{
		f[i]=g[i-1][0]+(i==1);
		g[i][0]=f[i];
		F(j,1,i-1)
		{
			g[i][0]=bar(g[i][0]+(ull)f[i-j]*g[j][0]);
			F(k,1,min(j,n-i)+1)g[i][k]=bar(g[i][k]+(ull)f[i-j]*(g[j][k]-g[j][k-1]+mod));
		}
		F(j,0,i-1)reduce_(g[i][j+1]-=g[i-1][j]);
		F(j,1,i-1)reduce(g[i][j-1]+=g[i-1][j]);
		F(j,0,i)g[i][j]=bar((ull)inv[i]*g[i][j]);
	}
	int ans=f[n];
	F(i,1,n)ans=bar((ull)i*ans);
	printf("%d\n",ans);
	return 0;
}