#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define all(a) (a).begin(), (a).end() #define bit32(x) (1 << (x)) #define bit64(x) (1ll << (x)) #define sz(v) ((int) v.size()) using namespace std; using i64 = long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vf80 = vector; using vstr = vector; inline void yes() { cout << "Yes" << endl; exit(0); } inline void no() { cout << "No" << endl; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template inline void amax(T &x, T y) { x = max(x, y); } template inline void amin(T &x, T y) { x = min(x, y); } template inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template istream& operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } void solve() { string s; getline(cin, s); while (getline(cin, s)) { int n = sz(s); string num; int start = 0, end = -1; rrep(i, n) { if (end == -1 && s[i] >= '0' && s[i] <= '9') end = i + 1; else if (end != -1 && !(s[i] >= '0' && s[i] <= '9')) { num = s.substr(i + 1, end - (i + 1)); start = i + 1; break; } } if (end == -1) { cout << s << endl; continue; } else if (start == 0) { num = s; } int up = 1; rrep(i, sz(num)) { if (up && num[i] == '9') { num[i] = '0'; } else if (up) { num[i] += up; up = 0; } } if (up) { num = '1' + num; } string ans = s.substr(0, start) + num + s.substr(end); cout << ans << endl; } }