import math
N, K = map(int, input().split())
ans = 0
for i in range(1, N+1):
    b = math.ceil(K / i-1).bit_length()
    ans += 1/pow(2, b)
print(ans/N) import math math N, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split K ans = 0 ans 0 for i in range(1, N+1):
    b = math.ceil(K / i-1).bit_length()
    ans += 1/pow(2, b) i range(1, N+1) range 1 N+1 N 1 b = math.ceil(K / i-1).bit_length() b math.ceil(K / i-1).bit_length() math.ceil(K / i-1).bit_length math.ceil(K / i-1) math.ceil math ceil K / i-1 K / i K i 1 bit_length ans += 1/pow(2, b) ans 1/pow(2, b) 1 pow(2, b) pow 2 b print(ans/N) print ans/N ans N N, K = map(int, input().split()) map(int, input().split()) N K = map(int, input().split()) map(int, input().split()) K ans = 0 0 ans b = math.ceil(K / i-1).bit_length() math.ceil(K / i-1).bit_length() b ans += 1/pow(2, b) 1/pow(2, b) ans
import math
N, K = map(int, input().split())
ans = 0
for i in range(1, N+1):
    b = math.ceil(K / i-1).bit_length()
    ans += 1/pow(2, b)
print(ans/N)
