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

# pows[i] = pow(2, i)
pows = [1]
while pows[-1] < k:
    pows.append(2 * pows[-1])

ans = 0
ind = -1
for i in range(1, n + 1):
    if -ind < len(pows) and pows[ind-1] * i >= k:
        ind -= 1
    ans += pows[-ind - 1]

print(ans / (pows[-1] * n)) n, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k pows = [1] pows [1] 1 while pows[-1] < k:
    pows.append(2 * pows[-1]) pows[-1] < k pows[-1] pows -1 k pows.append(2 * pows[-1]) pows.append pows append 2 * pows[-1] 2 pows[-1] pows -1 ans = 0 ans 0 ind = -1 ind -1 for i in range(1, n + 1):
    if -ind < len(pows) and pows[ind-1] * i >= k:
        ind -= 1
    ans += pows[-ind - 1] i range(1, n + 1) range 1 n + 1 n 1 if -ind < len(pows) and pows[ind-1] * i >= k:
        ind -= 1
     -ind < len(pows) and pows[ind-1] * i >= k -ind < len(pows) -ind ind len(pows) len pows pows[ind-1] * i >= k pows[ind-1] * i pows[ind-1] pows ind-1 ind 1 i k ind -= 1 ind 1 ans += pows[-ind - 1] ans pows[-ind - 1] pows -ind - 1 -ind ind 1 print(ans / (pows[-1] * n)) print ans / (pows[-1] * n) ans pows[-1] * n pows[-1] pows -1 n pows = [1] [1] pows ind -= 1 1 ind ans += pows[-ind - 1] pows[-ind - 1] ans ans = 0 0 ans k = map(int, input().split()) map(int, input().split()) k n, k = map(int, input().split()) map(int, input().split()) n ind = -1 -1 ind
n, k = map(int, input().split())

# pows[i] = pow(2, i)
pows = [1]
while pows[-1] < k:
    pows.append(2 * pows[-1])

ans = 0
ind = -1
for i in range(1, n + 1):
    if -ind < len(pows) and pows[ind-1] * i >= k:
        ind -= 1
    ans += pows[-ind - 1]

print(ans / (pows[-1] * n))