n, k = map(int, input().split())
prob = [0]*n
for i in range(1, n+1):
  j = 0
  while i*(2**j) < k:
    j += 1
  prob[i-1] = (1/n)*(1/2)**j

print(sum(prob)) n, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k prob = [0]*n prob [0]*n [0] 0 n for i in range(1, n+1):
  j = 0
  while i*(2**j) < k:
    j += 1
  prob[i-1] = (1/n)*(1/2)**j i range(1, n+1) range 1 n+1 n 1 j = 0 j 0 while i*(2**j) < k:
    j += 1
   i*(2**j) < k i*(2**j) i 2**j 2 j k j += 1 j 1 prob[i-1] = (1/n)*(1/2)**j prob[i-1] prob i-1 i 1 (1/n)*(1/2)**j 1/n 1 n (1/2)**j 1/2 1 2 j print(sum(prob)) print sum(prob) sum prob j += 1 1 j k = map(int, input().split()) map(int, input().split()) k prob = [0]*n [0]*n prob n, k = map(int, input().split()) map(int, input().split()) n j = 0 0 j
n, k = map(int, input().split())
prob = [0]*n
for i in range(1, n+1):
  j = 0
  while i*(2**j) < k:
    j += 1
  prob[i-1] = (1/n)*(1/2)**j

print(sum(prob))