N, K = map(int, input().split())
from math import log2, ceil

p = 0

for i in range(1, N+1):
    if K >= i:
        p += 2**-(ceil(log2(K / i))) / N
    else:
        p += 1 / N

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

p = 0

for i in range(1, N+1):
    if K >= i:
        p += 2**-(ceil(log2(K / i))) / N
    else:
        p += 1 / N

print(p)