text: #include <bits/stdc++.h>
  using namespace std;
   
  typedef long long ll;
  typedef long double ld;
  typedef double db; 
  typedef string str; 
   
  typedef pair<int,int> pi;
  typedef pair<ll,ll> pl; 
  typedef pair<ld,ld> pd; 
   
  typedef vector<int> vi; 
  typedef vector<ll> vl; 
  typedef vector<ld> vd; 
  typedef vector<str> vs; 
  typedef vector<pi> vpi;
  typedef vector<pl> vpl; 
  typedef vector<pd> vpd; 
   
  #define mp make_pair 
  #define f first
  #define s second
  #define sz(x) (int)x.size()
  #define all(x) begin(x), end(x)
  #define rall(x) (x).rbegin(), (x).rend() 
  #define rsz resize
  #define ins insert 
  #define ft front() 
  #define bk back()
  #define pf push_front 
  #define pb push_back
  #define eb emplace_back 
  #define lb lower_bound 
  #define ub upper_bound 
   
  #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
  #define F0R(i,a) FOR(i,0,a)
  #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
  #define R0F(i,a) ROF(i,0,a)
  #define trav(a,x) for (auto& a: x)
   
  int MOD = 1e9+7; // 998244353;
  const int MX = 2e5+5; 
  const ll INF = 1e18; 
  const ld PI = acos((ld)-1);
  const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
   
  template<class T> bool ckmin(T& a, const T& b) { 
  	return b < a ? a = b, 1 : 0; }
  template<class T> bool ckmax(T& a, const T& b) { 
  	return a < b ? a = b, 1 : 0; }
  int pct(int x) { return __builtin_popcount(x); } 
   
  namespace input {
  	template<class T> void re(complex<T>& x);
  	template<class T1, class T2> void re(pair<T1,T2>& p);
  	template<class T> void re(vector<T>& a);
  	template<class T, size_t SZ> void re(array<T,SZ>& a);
   
  	template<class T> void re(T& x) { cin >> x; }
  	void re(double& x) { string t; re(t); x = stod(t); }
  	void re(ld& x) { string t; re(t); x = stold(t); }
  	template<class T, class... Ts> void re(T& t, Ts&... ts) { 
  		re(t); re(ts...); 
  	}
   
  	template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = {a,b}; }
  	template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
  	template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
  	template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
  }
   
  using namespace input;
   
  namespace output {
  	void pr(int x) { cout << x; }
  	void pr(long x) { cout << x; }
  	void pr(ll x) { cout << x; }
  	void pr(unsigned x) { cout << x; }
  	void pr(unsigned long x) { cout << x; }
  	void pr(unsigned long long x) { cout << x; }
  	void pr(float x) { cout << x; }
  	void pr(double x) { cout << x; }
  	void pr(ld x) { cout << x; }
  	void pr(char x) { cout << x; }
  	void pr(const char* x) { cout << x; }
  	void pr(const string& x) { cout << x; }
  	void pr(bool x) { pr(x ? "true" : "false"); }
  	template<class T> void pr(const complex<T>& x) { cout << x; }
  	
  	template<class T1, class T2> void pr(const pair<T1,T2>& x);
  	template<class T> void pr(const T& x);
  	
  	template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
  		pr(t); pr(ts...); 
  	}
  	template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
  		pr("{",x.f,", ",x.s,"}"); 
  	}
  	template<class T> void pr(const T& x) { 
  		pr("{"); // const iterator needed for vector<bool>
  		bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
  		pr("}");
  	}
  	
  	void ps() { pr("\n"); } // print w/ spaces
  	template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
  		pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
  	}
  	
  	void pc() { pr("]\n"); } // debug w/ commas
  	template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
  		pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
  	}
  	#define dbg(x...) pr("[",#x,"] = ["), pc(x);
  }
   
  using namespace output;
   
  namespace io {
  	void setIn(string s) { freopen(s.c_str(),"r",stdin); }
  	void setOut(string s) { freopen(s.c_str(),"w",stdout); }
  	void setIO(string s = "") {
  		ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
  		// cin.exceptions(cin.failbit); 
  		// throws exception when do smth illegal
  		// ex. try to read letter into int
  		if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
  	}
  }
   
  using namespace io;
   
  mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
   
  /**
   * Description: modular arithmetic operations 
   * Source: 
  	* KACTL
  	* https://codeforces.com/blog/entry/63903
  	* https://codeforces.com/contest/1261/submission/65632855 (tourist)
  	* https://codeforces.com/contest/1264/submission/66344993 (ksun)
   * Verification: 
  	* https://open.kattis.com/problems/modulararithmetic
   */
   
  struct mi {
  	typedef decay<decltype(MOD)>::type T; 
   	/// don't silently convert to T
  	T v; explicit operator T() const { return v; }
  	mi() { v = 0; }
  	mi(ll _v) { 
  		v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
  		if (v < 0) v += MOD;
  	}
  	friend bool operator==(const mi& a, const mi& b) { 
  		return a.v == b.v; }
  	friend bool operator!=(const mi& a, const mi& b) { 
  		return !(a == b); }
  	friend bool operator<(const mi& a, const mi& b) { 
  		return a.v < b.v; }
  	friend void re(mi& a) { ll x; re(x); a = mi(x); }
  	friend void pr(const mi& a) { pr(a.v); }
  	friend ostream& operator<<(ostream& os, const mi& a) { 
  		return os << a.v; }
     
  	mi& operator+=(const mi& m) { 
  		if ((v += m.v) >= MOD) v -= MOD; 
  		return *this; }
  	mi& operator-=(const mi& m) { 
  		if ((v -= m.v) < 0) v += MOD; 
  		return *this; }
  	mi& operator*=(const mi& m) { 
  		v = (ll)v*m.v%MOD; return *this; }
  	mi& operator/=(const mi& m) { return (*this) *= inv(m); }
  	friend mi pow(mi a, ll p) {
  		mi ans = 1; assert(p >= 0);
  		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
  		return ans;
  	}
  	friend mi inv(const mi& a) { assert(a.v != 0); 
  		return pow(a,MOD-2); }
  		
  	mi operator-() const { return mi(-v); }
  	mi& operator++() { return *this += 1; }
  	mi& operator--() { return *this -= 1; }
  	friend mi operator+(mi a, const mi& b) { return a += b; }
  	friend mi operator-(mi a, const mi& b) { return a -= b; }
  	friend mi operator*(mi a, const mi& b) { return a *= b; }
  	friend mi operator/(mi a, const mi& b) { return a /= b; }
  };
  typedef vector<mi> vmi;
  typedef pair<mi,mi> pmi;
  typedef vector<pmi> vpmi;
   
  vector<vmi> comb;
  void genComb(int SZ) {
  	comb.assign(SZ,vmi(SZ)); comb[0][0] = 1;
  	FOR(i,1,SZ) F0R(j,i+1) 
  		comb[i][j] = comb[i-1][j]+(j?comb[i-1][j-1]:0);
  }
   
  int N,M;
   
  int ad(int a, int b) { 
  	a += b; if (a >= M) a -= M;
  	return a;
  }
  void AD(int& a, int b) { a = ad(a,b); }
  int sub(int a, int b) { 
  	a -= b; if (a < 0) a += M;
  	return a; 
  }
  int mul(int a, int b) { return (ll)a*b%M; }
  ll LCM(ll a, ll b) { return a/__gcd(a,b)*b; }
   
  map<ll,int> dp[5001];
   
  int main() {
  	setIO(); re(N,MOD); M = MOD-1;
  	dp[0][1] = 1;
  	FOR(i,1,N+1) {
  		int ways = 1;
  		FOR(j,1,i+1) {
  			trav(t,dp[i-j]) {
  				AD(dp[i][LCM(t.f,j)],mul(ways,t.s));
  			}
  			ways = mul(ways,i-j);
  		}
  	}
  	mi ans = 1;
  	// ps(dp[N].rbegin()->f);
  	trav(t,dp[N]) ans *= pow(mi(t.f),t.s);
  	ps(ans);
  	// ps(ans,sz(dp[N]));
  	// you should actually read the stuff at the bottom
  }
   
  /* stuff you should look for
  	* int overflow, array bounds
  	* special cases (n=1?)
  	* do smth instead of nothing and stay organized
  */