n,M=map(int,input().split())
f=[[] for i in range(n+1)]
for i in range(1,n+1):
  for j in range(i,n+1,i):
    f[j]+=[i]
fb=[1,1]
for i in range(2,n+1):
  fb+=[(M//i)*fb[M%i]*(-1)%M]
q=[0]*(n+1)
r=[0]*(n+1)
g=0
for i in range(3,n+1):
  g-=r[i]
  g%=M
  q[i]+=g
  q[i]+=i
  q[i]*=fb[i-len(f[i])]
  q[i]%=M
  g+=q[i]*len(f[i])
  g%=M
  for j in f[i]:
    if i+j<=n:
      r[i+j]+=q[i]
      r[i+j]%=M
print(q[n])