n, p = map(int, input().split())

inv = [0] * (n + 1)
inv[1] = 1
for i in range(2, n + 1):
  inv[i] = p - inv[p % i] * (p // i) % p

d = [[] for i in range(n + 1)]
for i in range(1, n + 1):
  for j in range(i, n + 1, i):
    d[j].append(i)

f = [0] * (n + 1)
tot = 0

for i in range(3, n + 1):
  sum = tot
  for j in d[i]:
    sum -= f[j]
  f[i] = (sum * inv[i] + 1) * i * inv[i - len(d[i])]
  f[i] %= p
  tot = (sum + f[i] * len(d[i])) % p
  for j in d[i]:
    f[j] = f[i]

print(f[n])