n,k = map(int,input().split())
ans = 0
for i in range(1,n+1):
    p = 1
    j = 0
    while i*pow(2,j) < k:
        j += 1
    ans += pow(0.5,j)/n
print(ans) n,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split k ans = 0 ans 0 for i in range(1,n+1):
    p = 1
    j = 0
    while i*pow(2,j) < k:
        j += 1
    ans += pow(0.5,j)/n i range(1,n+1) range 1 n+1 n 1 p = 1 p 1 j = 0 j 0 while i*pow(2,j) < k:
        j += 1
     i*pow(2,j) < k i*pow(2,j) i pow(2,j) pow 2 j k j += 1 j 1 ans += pow(0.5,j)/n ans pow(0.5,j)/n pow(0.5,j) pow 0.5 j n print(ans) print ans ans = 0 0 ans n,k = map(int,input().split()) map(int,input().split()) n p = 1 1 p j = 0 0 j k = map(int,input().split()) map(int,input().split()) k ans += pow(0.5,j)/n pow(0.5,j)/n ans j += 1 1 j
n,k = map(int,input().split())
ans = 0
for i in range(1,n+1):
    p = 1
    j = 0
    while i*pow(2,j) < k:
        j += 1
    ans += pow(0.5,j)/n
print(ans)