Codeforces Round 247 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

bitmasks

combinatorics

dp

math

*2100

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Random Task

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOne day, after a difficult lecture a diligent student Sasha saw a graffitied desk in the classroom. She came closer and read: "Find such positive integer *n*, that among numbers *n* + 1, *n* + 2, ..., 2·*n* there are exactly *m* numbers which binary representation contains exactly *k* digits one".

The girl got interested in the task and she asked you to help her solve it. Sasha knows that you are afraid of large numbers, so she guaranteed that there is an answer that doesn't exceed 10^{18}.

Input

The first line contains two space-separated integers, *m* and *k* (0 ≤ *m* ≤ 10^{18}; 1 ≤ *k* ≤ 64).

Output

Print the required number *n* (1 ≤ *n* ≤ 10^{18}). If there are multiple answers, print any of them.

Examples

Input

1 1

Output

1

Input

3 2

Output

5

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/05/2023 17:06:07 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|