C. Unique Numbertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a positive number x. Find the smallest positive integer number that has the sum of digits equal to x and all digits are distinct (unique).InputThe first line contains a single positive integer t (1 \le t \le 50) — the number of test cases in the test. Then t test cases follow.Each test case consists of a single integer number x (1 \le x \le 50).OutputOutput t answers to the test cases:  if a positive integer number with the sum of digits equal to x and all digits are different exists, print the smallest such number;  otherwise print -1. ExampleInput
4
1
5
15
50
Output
1
5
69
-1

4
1
5
15
50

1 5 69 -1 
['brute force', 'greedy', 'math', '*900']