N,K = map(int,input().split())

from math import ceil
cnt = 0
for i in range(1,N+1):
    a = ceil(K/i)
    if bin(a).count("1") == 1:
        b = a.bit_length()-1
    else:
        b = a.bit_length()
    cnt += (1/N)*(0.5**b)
print(cnt) N,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K from math import ceil cnt = 0 cnt 0 for i in range(1,N+1):
    a = ceil(K/i)
    if bin(a).count("1") == 1:
        b = a.bit_length()-1
    else:
        b = a.bit_length()
    cnt += (1/N)*(0.5**b) i range(1,N+1) range 1 N+1 N 1 a = ceil(K/i) a ceil(K/i) ceil K/i K i if bin(a).count("1") == 1:
        b = a.bit_length()-1
    else:
        b = a.bit_length()
     bin(a).count("1") == 1 bin(a).count("1") (a).count (a) bin a count "1" 1 b = a.bit_length()-1 b a.bit_length()-1 a.bit_length() a.bit_length a bit_length 1 b = a.bit_length() b a.bit_length() a.bit_length a bit_length cnt += (1/N)*(0.5**b) cnt (1/N)*(0.5**b) 1/N 1 N 0.5**b 0.5 b print(cnt) print cnt K = map(int,input().split()) map(int,input().split()) K b = a.bit_length()-1 a.bit_length()-1 b b = a.bit_length() a.bit_length() b cnt = 0 0 cnt N,K = map(int,input().split()) map(int,input().split()) N cnt += (1/N)*(0.5**b) (1/N)*(0.5**b) cnt a = ceil(K/i) ceil(K/i) a
N,K = map(int,input().split())

from math import ceil
cnt = 0
for i in range(1,N+1):
    a = ceil(K/i)
    if bin(a).count("1") == 1:
        b = a.bit_length()-1
    else:
        b = a.bit_length()
    cnt += (1/N)*(0.5**b)
print(cnt)