#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=300+5,M=5e5+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,p;ll f[N][N],frc[N],inv[N];
ll calc(int x,int y){return x>=y&&y>=0?frc[x]*inv[x-y]%p:0;}
int main(){
	int i,j,h;scanf("%d%d",&n,&p);
	inv[1]=1;for(i=2;i<=2*n;i++) inv[i]=(p-inv[p%i])*(p/i)%p;
	for(inv[0]=frc[0]=i=1;i<=2*n;i++) frc[i]=frc[i-1]*i%p,inv[i]=inv[i-1]*inv[i]%p;
	f[0][0]=1;
	for(i=1;i<=n;i++){
		for(j=0;j<=n;j++) {
			for(h=0;h<i;h++) {
				f[i][j]+=f[i-h-1][0]*calc(2*i+j-2-h,h+j)%p;
			}
			for(h=0;h<i;h++) if(j+h){
				ll w=(j+h)*calc(2*i+j-1-h-1,j+h-1)%p;
				for(int k=0;h+k<i;k++) {
					f[i][j]+=f[i-h-k-1][k]*w%p;
				}
			}
			f[i][j]%=p;
			// cerr<<f[i][j]<<' ';
		} 
		// cerr<<'\n';
	}
	ll tot=1;for(int i=1;i<=n;i++) tot=tot*(i*2-1)%p;
	printf("%lld\n",(tot-f[n][0]+p)%p);
}