CF431D.Random Task

One 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.

一天，在一堂艰难的课后，勤奋的学生萨沙在教室里看到一张被涂鸦的课桌。她走近一看，上面写着：“找出一个正整数 $n$，使得在数列 $n+1,\,n+2,\,\dots,\,2\cdot n$ 中，恰好有 $m$ 个数的二进制表示中恰好包含 $k$ 个数字 $1$。”

这位女孩对这个问题产生了兴趣，并请你帮她解决。萨沙知道你害怕大数，因此她保证存在一个不超过 $10^{18}$ 的答案。

The first line contains two space-separated integers, m and k (0 ≤ m ≤ 1018; 1 ≤ k ≤ 64).

第一行包含两个用空格分隔的整数 $m$ 和 $k$（$0 \le m \le 10^{18}$；$1 \le k \le 64$）。

Print the required number n (1 ≤ n ≤ 1018). If there are multiple answers, print any of them.

输出所需的数字 $n$（$1 ≤ n ≤ 10^{18}$）。如果存在多个答案，输出其中任意一个即可。