from math import sqrt
def divisor(N):
    ret = 0
    for i in range(2,int(sqrt(N))+1):
        if N % i == 0:
            ret += 1
            if N // i != i:
                ret += 1
    return ret

N,p = map(float,input().split())
N = int(N)
ans = 0
for i in range(2,N+1):
    ans += pow(1-p, divisor(i))
print(ans)