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 CPP):

Solution:
#include<stdio.h>
int a[50];
int main()
{
    int m,i,n,j,k;
    scanf("%d",&k);
    while(k--)
    {
        scanf("%d",&m);
        if(m>45)
            printf("-1\n");
        else
        {
            for(i=9;i>=1;i--)
            {
                m-=i;
                a[9-i]=i;
                if(m<=0)
                {
                    a[9-i]=m+i;
                    break;
                }
            }
            for(j=9-i;j>=0;j--)
            printf("%d",a[j]);
            printf("\n");
        }
    }
    return 0;
}