#include #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define o(a) cout << a << endl #define int long long #define fi first #define se second using namespace std; typedef pair P; string solve(string s,string t = "1"){ if(s.size()=0;i--,j--){ if(j>=0) s[i]+=t[j]-'0'; if(s[i]>'9'){ s[i]-=10; if(i==0) s='1'+s; else s[i-1]++; } } return s; } signed main(){ int t; cin >> t; getchar(); rep(i, 0, t){ string s; getline(cin, s); string t; int r = -1, l = -1; bool f = false; repb(i, s.size() - 1, 0){ if('0' <= s[i] && s[i] <= '9'){ if(f == true){ l = i; }else if(f == false){ r = i; l = i; f = true; } }else if(f == true){ break; } } if(l == -1 && r == -1){ cout << s << endl; continue; } // cout << l << " " << r << endl; t = s.substr(l, r - l + 1); // cout << t << endl; t = solve(t); // cout << t << endl; s = s.substr(0, l) + t + s.substr(r + 1); cout << s << endl; } }