#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,B;
int p[301000];
bool fl[301000];
int mod;
int qpow(int a,ll b){
    int c=1;
    for(;b;b>>=1){
        if(b&1)c=1ll*a*c%mod;
        a=1ll*a*a%mod;
    }
    return c;
}
int c;
ll id[301000],g[300100];
int ip1[301000],ip2[301000],o;
int ip(ll x){
	if(x<=B)return ip1[x];
	return ip2[n/x];
}
ll an[20];
void S(ll x,int e,int s){
	if(x<=p[e])return;
    an[s+1]+=g[ip(x)]-e;
	for(int i=e+1;i<=c&&1ll*p[i]*p[i]<=x;i++){
		ll P=p[i];
		for(int j=1;P<=x;j++,P*=p[i]){
            S(x/P,i,s+1);
            if(j!=1)an[s+1]++;
        }
	}
}
int main(){
	scanf("%lld%d",&n,&mod);B=(ll)sqrt(n);
	for(int i=2;i<=B;i++){
		if(!fl[i])p[++c]=i;
		for(int j=1;i*p[j]<=B&&j<=c;j++){
			fl[i*p[j]]=1;
			if(!(i%p[j]))break;
		}
	}
	for(ll i=1,j;i<=n;i=j+1){
		j=n/(n/i);id[++o]=n/i;
		g[o]=n/i-1;
		if(n/i<=B)ip1[n/i]=o;
		else ip2[n/(n/i)]=o;
	}
	for(int i=1;i<=c;i++){
		for(int j=1;j<=o&&1ll*p[i]*p[i]<=id[j];j++){
			int v=ip(id[j]/p[i]);
            g[j]-=(g[v]-(i-1));
		}
	}
    S(n,0,0);
    int ans=1;
    for(int i=2;i<=13;i++)ans=1ll*ans*qpow(i,an[i])%mod;
    printf("%d",ans);
	return 0;
}