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:
#!/usr/bin/env python3

import sys
input = sys.stdin.readline

def ri():
    return tuple(map(int, input().split(' ')))


for _ in range(int(input())):
    x = int(input())
    if x > 45:
        print(-1)
    else:
        nums = []
        st = 9
        while x > st:
            x -= st
            nums.append(str(st))
            st -= 1
        nums.append(str(x))
        print(''.join(nums[::-1]))