Codeforces 1462C Unique Number

#pragma GCC optimize(3, "Ofast", "inline")

#include <bits/stdc++.h>

#define start ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
//#define int ll
#define ls st<<1
#define rs st<<1|1
#define pii pair<int,int>
#define rep(z, x, y) for(int z=x;z<=y;++z)
#define repd(z, x, y) for(int z=x;z>=y;--z)
#define com bool operator<(const node &b)const
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const int maxn = (ll) 1e6 + 5;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
int T = 1;
int ans[maxn];

void dfs(int now, int nownum, int sum, int tot) {
    ans[tot] = min(sum,ans[tot]);
    for (int i = nownum; i <= 9; ++i) {
        dfs(now + 1, i + 1, sum * 10 + i, tot + i);
    }
}

void solve() {
    int x;
    cin >> x;
    if (ans[x] == inf)
        cout << -1 << '\n';
    else
        cout << ans[x] << '\n';
}

signed main() {
    start;
    memset(ans,inf,sizeof(ans));
    dfs(1, 1, 0, 0);
    cin >> T;
    while (T--)
        solve();
    return 0;
}