// Problem: # 8047. DFS Order 4
// Author: XZC(L_Wave)
// Language: Cpp/G++20
// Contest: 
// URL: https://qoj.ac/problem/8047
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Create Time: not 2024-11-20 11:04:29, but 1926-08-17 11:45:14
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i <= i##ABRACADABRA; i++)
#define drep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i >= i##ABRACADABRA; i--)
using namespace std;
using ll = long long;

ll mod;
int n;
 
ll fac[2000010], ifac[2000010];
ll qpow(ll x, ll y) {
  if (y < 0)
    y += mod - 1 + mod - 1;
  if (x == mod - 1)
    return y & 1 ? mod - 1 : 1;
  ll res = 1;
  for (; y; y >>= 1) {
    if (y & 1) {
      res *= x;
      res %= mod;
    }
    x *= x;
    x %= mod;
  }
  return res;
}
void init() {
  fac[0] = 1;
  rep(i, 1, 2000005)
    fac[i] = fac[i-1] * i % mod;
  ifac[2000005] = qpow(fac[2000005], -1);
  drep(i, 2000005, 1)
    ifac[i-1] = ifac[i] * i % mod;
}
ll choose(int x, int y) {
  if (x < y || y < 0)
    return 0;
  return fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

ll dp[888][888];

int main() {
  scanf("%d%lld",&n,&mod);
  init();
  dp[1][0]=1;
  rep(i,2,n)rep(j,0,n-i){
    dp[i][j]=dp[i-1][0];
    rep(k,2,i-2)(dp[i][j]+=dp[i-k][j]*(dp[k][0]-dp[k][i-1-k+j]+mod)%mod)%=mod;
    (dp[i][j]*=ifac[i+j-1]*fac[i+j-2]%mod)%=mod;
  }
  printf("%lld\n",dp[n][0]*fac[n-1]%mod);
  return 0;
}