Formation#4441

Formation

1 second
64 megabytes
Easy

Help Denis create a program that generates the -th lexicographically smallest valid bracket sequence consisting of brackets.

Input

The input consists of a single line containing two integers, and , where 1 \leq n \leq 18.

Output

Output the desired valid bracket sequence. It is guaranteed that such a sequence exists.

Examples

Example 1

Loading
Loading