#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

void solve(){
  string s;
  getline(cin, s);
  string ans;

  int i = s.size()-1;
  for(; i>=0; i--){
    if(isdigit(s[i])){
      int carry = 1;
      while(i>=0 && isdigit(s[i])){
        int d = s[i]-'0' + carry;
        if(d<=9){
          ans.pb('0'+d);
          carry = 0;
        }
        else {
          ans.pb('0');
          carry = 1;
        }
        i--;
      }
      if(carry) ans.pb('1');
      break;
    }
    else ans.pb(s[i]);
  }
  for(; i>=0; i--){
    ans.pb(s[i]);
  }
  reverse(all(ans));
  cout << ans << endl;
}

int main(){
  int t;
  cin>>t;
  scanf("\n");
  rep(_,t){
    solve();
  }

  return 0;
}