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

def f(x,y):
  cnt = 0
  while x > y:
    y = y << 1
    cnt +=1
  return cnt

ans = 0
for i in range(1,n+1):
  i2 = bin(i)
  cnt = f(k,i)
  ans += 0.5**cnt

print(ans/n) n,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split k def f(x,y):
  cnt = 0
  while x > y:
    y = y << 1
    cnt +=1
  return cnt f cnt = 0 cnt 0 while x > y:
    y = y << 1
    cnt +=1
   x > y x y y = y << 1 y y << 1 y 1 cnt +=1 cnt 1 return cnt cnt x x y y ans = 0 ans 0 for i in range(1,n+1):
  i2 = bin(i)
  cnt = f(k,i)
  ans += 0.5**cnt i range(1,n+1) range 1 n+1 n 1 i2 = bin(i) i2 bin(i) bin i cnt = f(k,i) cnt f(k,i) f k i ans += 0.5**cnt ans 0.5**cnt 0.5 cnt print(ans/n) print ans/n ans n k = map(int,input().split()) map(int,input().split()) k ans += 0.5**cnt 0.5**cnt ans ans = 0 0 ans n,k = map(int,input().split()) map(int,input().split()) n def f(x,y):
  cnt = 0
  while x > y:
    y = y << 1
    cnt +=1
  return cnt def f(x,y):
  cnt = 0
  while x > y:
    y = y << 1
    cnt +=1
  return cnt f i2 = bin(i) bin(i) i2 cnt = f(k,i) f(k,i) cnt
n,k = map(int,input().split())

def f(x,y):
  cnt = 0
  while x > y:
    y = y << 1
    cnt +=1
  return cnt

ans = 0
for i in range(1,n+1):
  i2 = bin(i)
  cnt = f(k,i)
  ans += 0.5**cnt

print(ans/n)