题号：NC25729
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
题目描述
As a programmer, you are probably familiar with the binary representation of integers. That is, write an integer x as 
, where each 
is either 0 or 1. Particularly, n-digit binary number can be written as 
, in which 
must equal to 1.
This time, to test your mastery of binary numbers, Leg Han raises a problem to you.
This time, to test your mastery of binary numbers, Leg Han raises a problem to you.
Among all n-digit binary numbers whose amount of 1 is m, please print the k-th smallest one.
It is guaranteed that k is legal.
输入描述:
The first line contains an integer number T, the number of test cases.
of each next T lines contains three integers n, m, k(
).
输出描述:
For each test case print the $k$-th smallest one.