#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define pr(str) cout<<(str)<<endl
#define prpr(str) cout<<str<<endl
#define db(str) cerr<<(str)<<endl
#define dbdb(str) cerr<<str<<endl
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

template<class InputIterator>
void dump(InputIterator first,InputIterator last,char delim=' '){
	for(InputIterator it=first;it!=last;it++){
		if(it!=first)cout<<delim;
		cout<<*it;
	}
}

int main(void){
	int n;
	string s;
	cin>>n;
	getline(cin,s);
	while(n--){
		getline(cin,s);
		int i;
		for(i=s.size()-1;i>=0&&!bw(0,s[i]-'0',9);i--);
		if(i<0){
			pr(s);
			continue;
		}
		int carry=1;
		while(i>=0&&bw(0,s[i]-'0',9)){
			if(carry){
				if(s[i]=='9')s[i]='0';
				else s[i]++,carry=0;
			}
			i--;
		}
		if(carry){
			pr(s.substr(0,i+1)+"1"+s.substr(i+1));
			continue;
		}else{
			pr(s);
			continue;
		}
	}
	return 0;
}