D. Random Tasktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard 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 1018.InputThe first line contains two space-separated integers, m and k (0 ≤ m ≤ 1018; 1 ≤ k ≤ 64).OutputPrint the required number n (1 ≤ n ≤ 1018). If there are multiple answers, print any of them.ExamplesInput1 1Output1Input3 2Output5
Input1 1
Output1
['binary search', 'bitmasks', 'combinatorics', 'dp', 'math', '*2100']