#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define rep2(i,j,k) for(int i=j;i>=k;i--)
#define ll long long
using namespace std;
template<typename T> void read(T &num){
char c=getchar();num=0;int f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){num=(num<<3)+(num<<1)+(c^48);c=getchar();}
num*=f;
}
int n;ll p;
struct wzy{
int yw,dzs;
}container[510];
ll dp[510][510];ll f[2][510][510];
int prime[8]={2,3,5,7,11,13,17,19};
inline bool cmp(wzy a,wzy b){
return (a.dzs!=b.dzs)?a.dzs<b.dzs:a.yw<b.yw;
}
inline void Pretreatment(){
rep(i,2,n){
int temp=i;
rep(j,0,7){
if(temp%prime[j]==0)container[i].yw|=(1<<j);
while(temp%prime[j]==0)temp/=prime[j];
}
container[i].dzs=temp;
}
sort(container+1,container+n+1,cmp);
return;
}
int main(){
read(n);read(p);
Pretreatment();
dp[0][0]=1;
rep(i,2,n){
if(i==2||container[i].dzs==1||container[i].dzs!=container[i-1].dzs){
rep2(j,1<<8,0){
rep2(k,1<<8,0){
f[1][j][k]=f[0][j][k]=dp[j][k];
}
}
}
rep2(j,1<<8,0){
rep2(k,1<<8,0){
if(!(container[i].yw&j)){
f[1][j][k|container[i].yw]+=f[1][j][k];
f[1][j][k|container[i].yw]%=p;
}
if(!(container[i].yw&k)){
f[0][j|container[i].yw][k]+=f[0][j][k];
f[0][j|container[i].yw][k]%=p;
}
}
}
if(i==n||container[i].dzs==1||container[i].dzs!=container[i+1].dzs){
rep2(j,1<<8,0){
rep2(k,1<<8,0){
dp[j][k]=(f[0][j][k]+f[1][j][k]-dp[j][k])%p;
dp[j][k]=(dp[j][k]+p)%p;
}
}
}
}
ll ans=0;
rep2(i,1<<8,0){
rep2(j,1<<8,0){
if(!(i&j))ans=(ans+dp[i][j])%p;
}
}
printf("%lld\n",ans);
return 0;
}