Sequence#1764
A sequence is called good if it does not contain three consecutive zeros.
The first line contains the number of test cases (1 \leq t \leq 10000). Each test case consists of two integers: (1 \leq n \leq 50) and .
For each test case, output the -th good sequence of length in lexicographical order.
It is guaranteed that there are at least good sequences.
Example 1