#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define Add(a, b, mod) ((a) = sum(a, b, mod))
#define meow(cat...) fprintf(stderr, cat)

const ll MaxN = 3e2 + 10;
const ll pr[] = {2, 3, 5, 7, 11, 13, 17, 19};

struct node
{
    ll val, big, msk;
    void calc()
    {
        ll tmp = val; big = -1;
        for (ll i = 0; i < 8; i++)
            if (tmp % pr[i] == 0)
            {
                msk |= (1 << i);
                while (tmp % pr[i] == 0)
                    tmp /= pr[i];
            }
        if (tmp > 1) big = tmp;
    }
} a[MaxN << 1];

ll n, p, f[MaxN][MaxN];
ll f1[MaxN][MaxN], f2[MaxN][MaxN];
ll cmp(node a, node b) { return a.big < b.big; }

signed main()
{
    scanf("%lld%lld", &n, &p);
    for (ll i = 1; i <= n - 1; i++)
        a[i].val = i + 1, a[i].calc();
    std::sort(a + 1, a + n, cmp), f[0][0] = 1;
    for (ll i = 1; i < n; i++)
    {
        if (i == 1 || a[i].big != a[i - 1].big || a[i].big == -1)
        {
            memcpy(f1, f, sizeof(f));
            memcpy(f2, f, sizeof(f));
        }
        for (ll j = 255; ~j; j--)
            for (ll k = 255; ~k; k--)
            {
                if (j & k) continue;
                if ((a[i].msk & k) == 0)
                    Add(f1[j | a[i].msk][k], f1[j][k], p);
                if ((a[i].msk & j) == 0)
                    Add(f2[j][k | a[i].msk], f2[j][k], p);
            }
        if (i == n - 1 || a[i].big != a[i + 1].big || a[i].big == -1)
        {
            for (ll j = 0; j < (1 << 8); j++)
                for (ll k = 0; k < (1 << 8); k++)
                    f[j][k] = sum(f1[j][k] + f2[j][k], p - f[j][k], p);
        }
    }
    ll ans = 0;
    for (ll j = 0; j <= 255; j++)
        for (ll k = 0; k <= 255; k++)
            if ((j & k) == 0) Add(ans, f[j][k], p);
    printf("%lld\n", ans);
    return 0;
}