import numpy as np
import collections

N,p = input().split()
N = int(N); p = float(p)

dp = np.zeros(N+1, np.int32)

for i in range(1, int(N**.5)+10):
    if i * i > N:
        break
    dp[i*i]+=1
    dp[i*(i+1):N+1:i] += 2
    
dp -= 2
    
ans = 0
c = collections.Counter(dp)
for v,n in c.most_common():
    if v < 0:
        continue
    ans += n*(1-p)**(v)
print(ans)