Help Denis create a program that generates the -th lexicographically smallest valid bracket sequence consisting of brackets.
The input consists of a single line containing two integers, and , where 1 \leq n \leq 18.
Output the desired valid bracket sequence. It is guaranteed that such a sequence exists.
Example 1