Codeforces Round 690 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

greedy

math

*900

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Unique Number

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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 \le t \le 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 \le x \le 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

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/09/2023 05:24:23 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|