Problem: You 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).

Input

The first line contains a single positive integer t (1 ≤ t ≤ 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 ≤ x ≤ 50).

Output

Output 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. 

Example

Input


4
1
5
15
50


Output


1
5
69
-1

Solution (in PYTHON3):

Solution:
import collections
N = int(input())
for _ in range(N):
    n = int(input())
    if(n < 10):
        print(n)
    elif(n < 18):
        print(str(n-9)+"9")
    elif(n < 25):
        print(str(n-17)+"89")
    elif(n < 31):
        print(str(n-24)+"789")
    elif(n < 36):
        print(str(n-30)+"6789")
    elif(n < 40):
        print(str(n-35)+"56789")
    elif(n < 43):
        print(str(n-39)+"456789")
    elif(n < 45):
        print(str(n-42)+"3456789")
    elif(n < 46):
        print("123456789")
    else:
        print(-1)