#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
string add(string f){
    ll n=f.size();
    per(i,n){
        if(f[i]!='9'){
            f[i]=char(f[i]+1);
            break;
        }
        else {
            f[i]='0';
            if(i==0){
                f="1"+f;
            }
        }
    }
    return f;
}
void solve(){
    string s;getline(cin,s);
    ll flag=false;
    string t;
    string fr,bc;
    per(i,s.size()){
        ll p=s[i]-'0';
        if(p>=0&&p<=9){
            if(!flag)flag=true;
            t+=s[i];
        }
        else{
            if(flag){
                fr=s.substr(0,i+1);
                break;
            }
            else bc+=s[i];
        }
    }
    rev(all(bc));
    rev(all(t));
    //cout << 99 <<" " << t << " " << add(t) << endl;
    cout << fr  << add(t)  << bc << endl;
}
int main(){
    ll t;cin >> t;
    string hoge;
    getline(cin,hoge);
    while(t--)solve();
}