DotA Quals

아직 제출이 없습니다시간 제한1초메모리 제한256 MB

문제

Today, instead of studying for the coming exams, a student with a nickname "Idned" has decided to take part in an open qualification for a huge DotA (Development of the Algorithms) tournament. The qualification is going to be a single-elimination tournament with 2n2^n participants, and Idned is one of them. There will be nn rounds in total. All other remaining participants will be randomly divided into pairs for each round with equal chances for any possible division. In each pair, the participants will play against each other, and the loser will quit the tournament (and will not participate in the further rounds).

Each participant has a unique rating, and Idned's rating is kk-th highest. Idned is sure that the outcome of each game is fully determined by the ratings of two participants, and whoever has a higher rating will win. Using this assumption, can you determine the expected number of rounds in which Idned will take part?

입력

The input contains two integers nn and kk: the total number of rounds and Idned's position in the overall rating (1n101 \le n \le 10; 1k2n1 \le k \le 2^n).

출력

Output the expected number of rounds.

Your answer must be correct to within an absolute or relative error of 10910^{-9}. Formally, let your answer be aa, and the jury's answer be bb. Your answer will be considered correct if abmax(1,b)109\frac{|a-b|}{\max(1, |b|)} \le 10^{-9}.