import sympy
N,p=map(float,input().split())
N=int(N)

def divisors(n):
  i=0
  ret=1
  while True:
    now=1
    while n%a[i]==0:
      n//=a[i]
      now+=1
    ret*=now
    i+=1
    if n<a[i]:
      return ret
a=list(sympy.primerange(2,10**6))
p=1-p
ans=0
for i in range(2,N+1):
  ans+=pow(p,divisors(i)-2)
print(ans)