1 #include <cstdio>
 2 #include <iostream>
 3 #define N 1000010
 4 #define ll long long
 5 using namespace std;
 6 int n,p,size[N];
 7 ll inv[N],fac[N],f[N];
 8 ll C(ll n,ll m) { return m>n?0:(n<p?fac[n]*inv[m]%p*inv[n-m]%p:C(n/p,m/p)*C(n%p,m%p)); }
 9 int main()
10 {
11     scanf("%d%d",&n,&p),fac[0]=inv[0]=inv[1]=1;
12     for (int i=1;i<=min(n,p-1);i++) fac[i]=fac[i-1]*i%p;
13     for (int i=2;i<=min(n,p-1);i++) inv[i]=(p-p/i)*inv[p%i]%p;
14     for (int i=2;i<=min(n,p-1);i++) inv[i]=(inv[i]*inv[i-1])%p;
15     for (int i=n;i;i--)
16         if (i*2+1<=n) size[i]=1+size[i*2]+size[i*2+1],f[i]=f[2*i]*f[2*i+1]%p*C(size[i]-1,size[2*i])%p;
17         else if (i*2<=n) size[i]=1+size[i*2],f[i]=f[2*i];
18         else size[i]=f[i]=1;
19     printf("%lld",f[1]);
20 }