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:
for _ in range (int(input())):
    n=int(input())
    if n==43:
        print("13456789")
        continue
    elif n==44:
        print("23456789")
        continue
    elif n==45:
        print("123456789")
        continue
    s=set()
    curr=9
    num=0
    copy=n
    ch=1
    while n>9:
        if curr<1:
            ch=0
            break
        num=num*10+curr
        s.add(curr)
        n-=curr
        curr-=1
    if ch==0:
        print(-1)
    elif n in s:
        num=num*10+curr
        s.add(curr)
        n-=curr
        curr-=1
        if n in s:
            print(-1)
        else:
            num=num*10+n
            num=str(num)
            num=num[::-1]
            print(num)
    else:
        num=num*10+n
        num=str(num)
        num=num[::-1]
        print(num)