from math import log2,ceil

N,K=map(int,input().split())
SUM=0
for i in range(1,N+1):
  if i<K:
    n_trial = ceil(log2(K/i))
    tmp = 1/(2**n_trial)
  else:
    tmp = 1
  SUM += tmp
print(SUM/N) from math import log2,ceil N,K=map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K SUM=0 SUM 0 for i in range(1,N+1):
  if i<K:
    n_trial = ceil(log2(K/i))
    tmp = 1/(2**n_trial)
  else:
    tmp = 1
  SUM += tmp i range(1,N+1) range 1 N+1 N 1 if i<K:
    n_trial = ceil(log2(K/i))
    tmp = 1/(2**n_trial)
  else:
    tmp = 1
   i<K i K n_trial = ceil(log2(K/i)) n_trial ceil(log2(K/i)) ceil log2(K/i) log2 K/i K i tmp = 1/(2**n_trial) tmp 1/(2**n_trial) 1 2**n_trial 2 n_trial tmp = 1 tmp 1 SUM += tmp SUM tmp print(SUM/N) print SUM/N SUM N N,K=map(int,input().split()) map(int,input().split()) N SUM=0 0 SUM SUM += tmp tmp SUM n_trial = ceil(log2(K/i)) ceil(log2(K/i)) n_trial K=map(int,input().split()) map(int,input().split()) K tmp = 1/(2**n_trial) 1/(2**n_trial) tmp tmp = 1 1 tmp
from math import log2,ceil

N,K=map(int,input().split())
SUM=0
for i in range(1,N+1):
  if i<K:
    n_trial = ceil(log2(K/i))
    tmp = 1/(2**n_trial)
  else:
    tmp = 1
  SUM += tmp
print(SUM/N)