|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
Given N, print all N digit numbers in increasing order, such that their digits are in strictly increasing order(from left to right).
First line of input contains T denoting number of test cases. Only line of each test case contains one integers N, as described above.
For each test case output a single line containing all the possible numbers as described above(Numbers should be space separated).
1<= T <= 9
1<= N <= 9
12 13 14…89
For N=2, the correct sequence is 12 13 14 15 16 17 18 19 23 24 and so on up to 89.