#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

void solve() {
    string s;
    getline(cin, s);
    string before = "", value = "", after = "";
    bool found = false;
    rrep(i, len(s)) {
        if (found) {
            if ((s[i] >= '0') && (s[i] <= '9')) {
                if (before == "") {
                    value += s[i];
                }
                else {
                    before += s[i];
                }
            }
            else {
                before += s[i];
            }
        }
        else {
            if ((s[i] >= '0') && (s[i] <= '9')) {
                found = true;
                value += s[i];
            }
            else {
                after += s[i];
            }
        }
    }
    if (value != "") {
        ll rem = 1;
        rep(i, len(value)) {
            if (value[i] == '9') {
                value[i] = '0';
            }
            else {
                value[i] = (char)(value[i] + 1);
                rem = 0;
                break;
            }
        }
        if (rem == 1) {
            value += '1';
        }
    }
    reverse(all(before));
    reverse(all(value));
    reverse(all(after));
    printf("%s%s%s\n", before.c_str(), value.c_str(), after.c_str());
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string st;
    getline(cin, st);
    ll t = atoi(st.c_str());
    rep(i, t) solve();
    return 0;
}