#define  _CRT_SECURE_NO_WARNINGS 
#pragma warning(disable:6031)
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<unordered_set>
#include<unordered_map>
#include<iomanip>
#include<bitset>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double>pdd;
#define PI acos(-1)

int infinity1 = 0x7fffffff, infinity2 = 0x3f3f3f3f;
//double memset max:0x42,min:0xc2
//int const  P = 131;
//ios::sync_with_stdio(false);

double eps = 1e-9;
const int N = 510, M = 8, MOD = 1e9+7;
int pri[8] = { 2,3,5,7,11,13,17,19 };
struct node {
    int w, x;
    int b;
}a[N];
bool cmp(node a, node b) {
    return a.b < b.b;
}
LL f[1 << M][1 << M],g1[1<<M][1<<M],g2[1<<M][1<<M];
int main() {
    LL n,p;
    cin >> n>>p;
    for (int i = 2; i <= n; i++) {
        a[i-1].w = i;
        int x = 0,b=-1,temp=i;
        for (int j = 0; j < 8; j++) {
            if (i % pri[j] == 0)x |= 1 << j;
            while (temp % pri[j] == 0)temp /= pri[j];
        }
        if (temp != 1)b = temp;
        a[i-1].x = x;
        a[i - 1].b = b;
    }
    sort(a + 1, a + n,cmp);
    f[0][0] = 1;
    for (int i = 1; i < n; i++) {
        if (i == 1 || a[i].b != a[i - 1].b || a[i].b == -1) {
            memcpy(g1, f, sizeof g1);
            memcpy(g2, f, sizeof g2);
        }
        for(int k= (1 << M)-1;k>=0;k--)
            for (int j = (1 << M)-1; j >= 0; j--) {
                if (k & j)continue;
                if ((a[i].x & k)==0)g1[k|a[i].x][j] = (g1[k | a[i].x][j] + g1[k][j]) % p;
                if ((a[i].x & j)==0)g2[k][j|a[i].x] = (g2[k][j | a[i].x] + g2[k][j]) % p;
            }
        if (i == n - 1 || a[i].b != a[i + 1].b || a[i].b == -1) {
            for (int i = (1 << M)-1; i >= 0; i--)
                for (int j = (1 << M)-1; j >= 0; j--) {
                    if (i & j)continue;
                    f[i][j] = (g1[i][j] + g2[i][j] - f[i][j]) % p;
                }
        }
    }
    LL res = 0;
    for (int i = (1 << M)-1; i >= 0; i--)
        for (int j = (1 << M)-1; j >= 0; j--) {
            if (i & j)continue;
            if(f[i][j])res = (res + f[i][j]) % p;
        }
    cout << res%p << endl;
}
```-