Tournament Wins

You are one of $2^k$ competitors in a single elimination tournament. The published rankings place you $r$th, and rank 1 is the strongest. In any match the higher ranked player always wins, so the player with the smaller rank number advances.

The bracket is the only source of uncertainty. Every way of assigning the $2^k$ competitors to the bracket slots is equally likely. Determine your expected number of wins, the average of your win count over all bracket orderings.

The input is a single line containing the two space separated integers $k$ ($1 \le k \le 20$) and $r$ ($1 \le r \le 2^k$).

Print your expected number of wins on a single line, rounded to exactly five decimal places. The sixth digit after the decimal point of the exact answer is never 4 or 5, so the rounding is never ambiguous.

Intermediate values can become very small or very large, so pick your arithmetic with care.