#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define pb push_back
#define mp make_pair
#define READS(x); string x;cin >> x;
#define READ(x); int x;cin >> x;
#define DOUREAD(x,y); int x,y;cin >> x >> y;
#define TRIREAD(x,y,z); int x,y,z;cin >> x >> y >> z;
const int MAXN = 500;
int N,MOD;
int dp[MAXN][MAXN],F1[MAXN][MAXN],F2[MAXN][MAXN];
struct NUM{
    int VAL,BIG,mask;  
};
NUM A[3*MAXN];
bool cmp(NUM X,NUM Y){
    return X.BIG < Y.BIG;
}
signed main(){fast
    cin >> N >> MOD;
    vector<int> PRIME;
    PRIME.pb(2);PRIME.pb(3);
    PRIME.pb(5);PRIME.pb(7);
    PRIME.pb(11);PRIME.pb(13);
    PRIME.pb(17);PRIME.pb(19);
    for(int i = 1; i <= N-1 ; i++){
        A[i].VAL = i+1;
        A[i].BIG = -1;
        int TEM = i+1;
        int CNT = 0;
        for(auto X : PRIME){
            if(TEM%X == 0){
                //cout << CNT << " " << i << " " << X << "div\n";
                A[i].mask |= (1<<CNT);
                while(TEM%X == 0) TEM /= X;
            }
            CNT++;
        }
        if(TEM != 1) A[i].BIG = TEM;
    }
    // for(int i = 1; i <= N-1 ; i++){
    //     cout << A[i].VAL << " " << A[i].BIG << "check\n";
    // }
    sort(A+1,A+N,cmp);
    dp[0][0] = 1;
    int MAXM = 255;
    for(int i = 1; i <= N-1 ; i++){
        if((i == 1) || (A[i].BIG != A[i-1].BIG) || (A[i].BIG == -1)){
            memcpy(F1,dp,sizeof(F1));
            memcpy(F2,dp,sizeof(F2));
        }
        for(int S1 = MAXM ; S1 >= 0 ; S1--){
            for(int S2 = MAXM ; S2 >= 0 ; S2--){
                if((S1&S2) == 0){
                    if((A[i].mask&S2) == 0) F1[S1|A[i].mask][S2] = (F1[S1|A[i].mask][S2] + F1[S1][S2])%MOD;
                    if((A[i].mask&S1) == 0) F2[S1][S2|A[i].mask] = (F2[S1][S2|A[i].mask] + F2[S1][S2])%MOD;
                }
            }
        }
        if((i == N-1) || (A[i].BIG != A[i+1].BIG) || (A[i].BIG == -1)){
            for(int S1 = MAXM ; S1 >= 0 ; S1--){
                for(int S2 = MAXM ; S2 >= 0 ; S2--){
                    if((S1&S2) == 0){
                        dp[S1][S2] = ((F1[S1][S2] + F2[S1][S2])%MOD - dp[S1][S2] + MOD)%MOD;
                    }
                }
            }
        }
    }
    int SUM = 0;
    for(int S1 = MAXM ; S1 >= 0 ; S1--){
        for(int S2 = MAXM ; S2 >= 0 ; S2--){
            if(((S1&S2) == 0)) SUM = (SUM + dp[S1][S2])%MOD;
        }
    }
    cout << SUM << '\n';
}