#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x)
{
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
int n, mod;
int qmod(int x) { return x >= mod ? x - mod : x; }
int s[505];
int prime[8] = {2, 3, 5, 7, 11, 13, 17, 19};
int f[1 << 8][1 << 8], tmp[1 << 8][1 << 8], g[1 << 8][1 << 8], h[1 << 8][1 << 8];
vector<int> vec[505];
int main()
{
	read(n); read(mod);
	for (int i = 2; i <= n; i++)
	{
		int x = i;
		for (int j = 0; j < 8; j++)
		{
			while (x % prime[j] == 0)
			{
				s[i] |= 1 << j;
				x /= prime[j];
			}
		}
		vec[x].push_back(i);
	}
	f[0][0] = 1;
	for (int i : vec[1])
	{
		memcpy(tmp, f, sizeof(tmp));
		for (int s1 = 0; s1 < 256; s1++)
			for (int s2 = 0; s2 < 256; s2++)
			{
				if ((s[i] & s1) == 0) f[s1][s2 | s[i]] = qmod(f[s1][s2 | s[i]] + tmp[s1][s2]);
				if ((s[i] & s2) == 0) f[s1 | s[i]][s2] = qmod(f[s1 | s[i]][s2] + tmp[s1][s2]);
			}
	}
	for (int i = 2; i <= 500; i++) if (vec[i].size())
	{
		memcpy(g, f, sizeof(g)); memcpy(h, f, sizeof(h));
		for (int j : vec[i])
		{
			for (int s2 = 0; s2 < 256; s2++) if ((s2 & s[j]) == 0)
				for (int s1 = 255; ~s1; s1--)
					g[s1 | s[j]][s2] = qmod(g[s1 | s[j]][s2] + g[s1][s2]);
			for (int s1 = 0; s1 < 256; s1++) if ((s1 & s[j]) == 0)
				for (int s2 = 255; ~s2; s2--)
					h[s1][s2 | s[j]] = qmod(h[s1][s2 | s[j]] + h[s1][s2]);
		}
		for (int s1 = 0; s1 < 256; s1++)
			for (int s2 = 0; s2 < 256; s2++)
				f[s1][s2] = qmod(qmod(g[s1][s2] + h[s1][s2]) - f[s1][s2] + mod);
	}
	int ans = 0;
	for (int s1 = 0; s1 < 256; s1++)
		for (int s2 = 0; s2 < 256; s2++)
			ans = qmod(ans + f[s1][s2]);
	printf("%d\n", ans);
	return 0;
}