#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
const int bufsize = 230005;
char buf[bufsize], *f1, *f2;
#define getchar() (f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++)
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
int n,mod;
int qmi(int x,int y) {
	int res=1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}return res;
}
const int N=1e3+10;
int jc,inv[N],f[N][N];
void solve() {
	in(n),in(mod);
	f[1][0]=1;
	int res=1;
	rep(i,1,n) inv[i]=qmi(i,mod-2),res=res*i%mod;
	res=res*qmi(n,mod-2)%mod;
	rep(i,2,n) {
		rep(j,0,n-i) {
			f[i][j]=f[i-1][0];
			rep(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]*inv[i+j-1]%mod;
		}
	}
	res=res*f[n][0]%mod;
	printf("%lld\n",res);
}
fire main() {
	while(T--) {
		solve();
	}
	return false;
}