Find the minimum number with the given sum of digits ss such that all digits in it are distinct (i.e. all digits are unique).
For example, if s=20s=20, then the answer is 389389. This is the minimum number in which all digits are different and the sum of the digits is 2020 (3+8+9=203+8+9=20).
For the given ss print the required number.
The first line contains an integer tt (1≤t≤451≤t≤45) — the number of test cases.
Each test case is specified by a line that contains the only integer ss (1≤s≤451≤s≤45).
Print tt integers — the answers to the given test cases.
4
20
8
45
10
389
8
123456789
19