#ifdef _MSC_VER
#  define _CRT_SECURE_NO_WARNINGS
#  define _USE_MATH_DEFINES
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif

#include <bits/stdc++.h>
using namespace std;
using i32 = int; using i64 = long long int; using f64 = double;
using u32 = unsigned int; using u64 = unsigned long long int; using str = string;
template <typename T> using vec = vector<T>; void in() { }
template <typename T, typename...TS> void in(T &&x, TS &&...xs) { cin >> x; in(move(xs)...); }
template <typename T> void out(T &&x) { cout << x << "\n"; }
template <typename T, typename...TS> void out(T &&x, TS &&...xs) { cout << x << " "; out(move(xs)...); }
#define indef(t, ...) t __VA_ARGS__; in(__VA_ARGS__)
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(a, b, i) for (i32 i = (a); i < (b); ++i)
#define upto(a, b, i) for (i32 i = (a); i <= (b); ++i)
#define downto(a, b, i) for (i32 i = (a); i >= (b); --i)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define even(x) ((abs(x) & 1) == 0)
#define odd(x) ((abs(x) & 1) == 1)
#define bit(x, i) (((x) >> i) & 1)
#define append emplace_back
#define bisect_left lower_bound
#define bisect_right upper_bound
#define bound(a, x, b) (a <= x && x <= b)
const i64 MOD = 1000000007ll;
const f64 EPS = 1e-10;

str solve() {
    str s; getline(cin, s);
    i32 n = s.size();
    i32 l = n-1, r = -1;
    downto(n-1, 0, si) {
        if ('0' <= s[si]& s[si] <= '9') {
            if (r < 0) {
                r = si;
            }
            l = si;
            continue;
        }
        else {
            if (r >= 0) {
                break;
            }
        }
    }
    if (r < 0) return s;

    str t = "";
    upto(l, r, si) {
        t += s[si];
    }
    i32 ti = t.size() - 1;
    while (ti >= 0) {
        if (t[ti] == '9') {
            t[ti] = '0';
        }
        else {
            t[ti]++;
            break;
        }
        if (ti == 0) {
            t = "1" + t;
            break;
        }
        ti--;
    }
    str ret = "";
    upto(0, l-1, si) {
        ret += s[si];
    }
    ret += t;
    upto(r+1, n-1, si) {
        ret += s[si];
    }
    return ret;
}

i32 main()
{
    ios::sync_with_stdio(false);

#ifdef _MSC_VER
    /**
    ifstream fin("input.txt"); cin.rdbuf(fin.rdbuf()); assert(fin);
    ofstream fout("output.txt"); cout.rdbuf(fout.rdbuf()); assert(fout);
    /**/
#endif

    indef(i32, t); cin.ignore();
    times(t, ti) {
        out(solve());
    }

    return 0;
}