#pragma GCC target("avx2") #pragma GCC optimize("03") #pragma GCC optimize("unroll-loops") #include using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; #define endl "\n" #define FOR(i,a,b) for(int i=(a);i<=(b);i++) #define rep(i,n) for(int i=0;i<(n);i++) #define PII pair #define PLL pair #define ALL(x) (x).begin(), (x).end() constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1; templateinline bool chmax(T &a, const T &b) { if (ainline bool chmin(T &a, const T &b) { if (binline int popcount(T a) {return __builtin_popcount(a);} templateinline T emod(T a, T p) { return (a%p + p) % p;} //------------------- int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); int T; cin >> T; cin.ignore(); auto f = [](string s) { auto suugi = [](char c) { if(0 <= (int) c-'0' and (int) c-'0' <= 9) return true; else return false; }; auto suugi8 = [](char c) { if(0 <= (int) c-'0' and (int) c-'0' <= 8) return 1; else if((int) c-'0' == 9) return 2; else return 0; }; string res; int idx = s.size()-1; while(idx >= 0 and !suugi(s[idx])) { res += s[idx]; idx--; } if(idx>=0) { bool next = true; while(next and idx >= 0) { if(suugi8(s[idx])==1) { res += s[idx]+1; next = false; } else if(suugi8(s[idx])==2) { res += '0'; } else { res += '1'; next = false; continue; } idx--; } if(next) res += '1'; while(idx >= 0) res += s[idx--]; } reverse(ALL(res)); cout << res << endl; }; rep(_, T) { string s; getline(cin, s); f(s); } return 0; }