import math
N,K = map(int,input().split())
prob = 0
for i in range(1,N+1):
    win_seq = max(math.ceil(math.log2(K/i)),0)
    prob += (1/2)**win_seq
print(prob/N) import math math N,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K prob = 0 prob 0 for i in range(1,N+1):
    win_seq = max(math.ceil(math.log2(K/i)),0)
    prob += (1/2)**win_seq i range(1,N+1) range 1 N+1 N 1 win_seq = max(math.ceil(math.log2(K/i)),0) win_seq max(math.ceil(math.log2(K/i)),0) max math.ceil(math.log2(K/i)) math.ceil math ceil math.log2(K/i) math.log2 math log2 K/i K i 0 prob += (1/2)**win_seq prob (1/2)**win_seq 1/2 1 2 win_seq print(prob/N) print prob/N prob N prob = 0 0 prob N,K = map(int,input().split()) map(int,input().split()) N prob += (1/2)**win_seq (1/2)**win_seq prob K = map(int,input().split()) map(int,input().split()) K win_seq = max(math.ceil(math.log2(K/i)),0) max(math.ceil(math.log2(K/i)),0) win_seq
import math
N,K = map(int,input().split())
prob = 0
for i in range(1,N+1):
    win_seq = max(math.ceil(math.log2(K/i)),0)
    prob += (1/2)**win_seq
print(prob/N)