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:
from math import *
sInt = lambda: int(input())
mInt = lambda: map(int, input().split())
lInt = lambda: list(map(int, input().split()))

t = sInt()

for _ in range(t):
    n = sInt()
    if n>45:
        print(-1)
    elif n//10==0:
        print(n)
    else:
        a=[9]
        n-=9
        i = 8
        while n!=0:
            if (n//10==0) and n<=i:
                a.insert(0,n)
                n = 0
            else:
                a.insert(0,i)
                n-=i
                i-=1
        print(*a,sep='')