#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define int long long
const int N = 2e6 + 5;

int is_prime[N], prime[N], pre[N], cnt;
int count1[N];

void euler(int n){
	for(int i = 2; i <= n; i++){
		if(!is_prime[i]) prime[cnt++] = i, pre[i] = i;
		for(int j = 0; j < cnt && i * prime[j] <= n; j++){
			is_prime[i * prime[j]] = 1;
			pre[i * prime[j]] = prime[j];
			if(i % prime[j] == 0) break;
		}
	}
}

int fast_power(int a, int b, int p){
	int ans = 1;
	while(b){
		if(b & 1) ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}

void solve(){
	int n, p;
	cin >> n >> p;
	euler(n * 2);
	for(int i = 1; i <= n; i++) count1[i] = -1;
	for(int i = n + 2; i <= 2 * n; i++) count1[i] = 1;
	for(int i = 2 * n; i > 1; i--){
		if(pre[i] < i){
			count1[pre[i]] += count1[i];
			count1[i / pre[i]] += count1[i];
		}
	}
	int ans = 1;
	for(int i = 2; i <= n * 2; i++){
		if(pre[i] == i){
			ans = ans * fast_power(i, count1[i], p) % p;
		}
	}
	cout << ans << '\n';
}

signed main(){
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	return 0;
}