#include <bits/stdc++.h>
using namespace std;
const int prime[] = {2, 3, 5, 7, 11, 13, 17, 19};

int n, P; 
int f[256][256], g1[256][256], g2[256][256]; // g1 表示 1 取 big，g2 表示 2 取 big

struct Number {
    int val, S, big; 
    void init(void) {
        int tmp = val; big = -1; 
        for (int i = 0; i < 8; ++i) if (tmp % prime[i] == 0) {
            S |= 1 << i; 
            while (tmp % prime[i] == 0) tmp /= prime[i];
        }
        if (tmp > 1) big = tmp; 
    }
    bool operator< (const Number &a) const { return big < a.big; }
} a[505];

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> P; 
    for (int i = 1; i < n; ++i) a[i].val = i + 1, a[i].init();
    sort(a + 1, a + n); 
    for (int i = f[0][0] = 1; i < n; ++i) {
        if (i == 1 || a[i].big == -1 || a[i].big != a[i - 1].big)
            memcpy(g1, f, sizeof g1), 
            memcpy(g2, f, sizeof g2);
        for (int j = 255; j >= 0; --j) for (int k = 255; k >= 0; --k) 
            if ((j & k) == 0) {
                if ((a[i].S & k) == 0) g1[j | a[i].S][k] = (g1[j | a[i].S][k] + g1[j][k]) % P; 
                if ((a[i].S & j) == 0) g2[j][k | a[i].S] = (g2[j][k | a[i].S] + g2[j][k]) % P; 
            }
        if (i == n - 1 || a[i].big == -1 || a[i].big != a[i + 1].big) {
            for (int j = 0; j < 256; ++j) for (int k = 0; k < 256; ++k)
                if ((j & k) == 0) f[j][k] = (0ll + g1[j][k] + g2[j][k] - f[j][k]) % P; 
        }
    }
    int ans = 0; 
    for (int i = 0; i < 256; ++i) for (int j = 0; j < 256; ++j)
        if ((i & j) == 0) ans = (ans + f[i][j]) % P;
    cout << (ans + P) % P;  
    return 0; 
}