[Solution] Minimum Varied Number Codeforces Solution

C. Minimum Varied Number

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Find the minimum number with the given sum of digits s$s$ such that all digits in it are distinct (i.e. all digits are unique).

For example, if s=20$s=20$, then the answer is 389$389$. This is the minimum number in which all digits are different and the sum of the digits is 20$20$ (3+8+9=20$3+8+9=20$).

For the given s$s$ print the required number.

Input

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 occupied

The first line contains an integer t$t$ (1≤t≤45$1\le t\le 45$) — the number of test cases.

Each test case is specified by a line that contains the only integer s$s$ (1≤s≤45$1\le s\le 45$).

Output

Print t$t$ integers — the answers to the given test cases