n,k=map(int,input().split())

ans= 0
from math import ceil,log2

for i in range(1,n+1):
    if i<k:
        a = ceil(log2(k/i))
        ans +=(1/n)*(1/2)**a
    else:
        ans += (1/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 from math import ceil,log2 for i in range(1,n+1):
    if i<k:
        a = ceil(log2(k/i))
        ans +=(1/n)*(1/2)**a
    else:
        ans += (1/n) i range(1,n+1) range 1 n+1 n 1 if i<k:
        a = ceil(log2(k/i))
        ans +=(1/n)*(1/2)**a
    else:
        ans += (1/n) i<k i k a = ceil(log2(k/i)) a ceil(log2(k/i)) ceil log2(k/i) log2 k/i k i ans +=(1/n)*(1/2)**a ans (1/n)*(1/2)**a 1/n 1 n (1/2)**a 1/2 1 2 a ans += (1/n) ans 1/n 1 n print(ans) print ans ans= 0 0 ans k=map(int,input().split()) map(int,input().split()) k a = ceil(log2(k/i)) ceil(log2(k/i)) a ans += (1/n) 1/n ans n,k=map(int,input().split()) map(int,input().split()) n ans +=(1/n)*(1/2)**a (1/n)*(1/2)**a ans
n,k=map(int,input().split())

ans= 0
from math import ceil,log2

for i in range(1,n+1):
    if i<k:
        a = ceil(log2(k/i))
        ans +=(1/n)*(1/2)**a
    else:
        ans += (1/n)

print(ans)
