#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 3e6 + 10;
ll nx , mod;
ll ans ;
ll fast(ll b , ll p){
ll ans = 1;
while(p){
if(p & 1){
ans = ans * b ; ans %= mod;
}
p = p / 2;
b = b * b; b %= mod;
}
return ans % mod;
}
ll C(ll n,ll m){
ll son = 1 , mum = 1;
if(!m) return 1;
if(m > n) return 0;
if(m > n - m) m = n - m;
for(ll i = 0 ; i < m ; i++){
son = (son * (n - i)) % mod;
mum = (mum * (i + 1)) % mod;
}
return son * fast(mum , mod - 2) % mod;
}
ll lucas(ll n,ll m){
if(m == 0) return 1;
return lucas(n / mod,m / mod) * C(n % mod,m % mod) % mod;
}
ll size[maxn];
void dfsz(ll x){
size[x] = 1;
for(ll i = x * 2 ; i <= x * 2 + 1 ; i++){
if(i <= nx){
dfsz(i);//这里类似于先建好树
size[x] += size[i];
}
}
}
ll dfs(ll x){
if(x > nx) return 1;
return lucas(size[x] - 1 , size[2 * x]) * dfs(2 * x) % mod * dfs(2 * x + 1) % mod;
}
int main(){
scanf("%lld%lld",&nx,&mod);
dfsz(1);
printf("%lld",dfs(1)%mod);
return 0;
}