#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

string straddone(string s){
	reverse(s.begin(), s.end());
	bool kuriagari = true;
	for(int i = 0; i < s.size(); i++){
		bool tmp = kuriagari;
		kuriagari = 10 <= ((s[i] - '0') + kuriagari);
		s[i] = '0' + (((s[i] - '0') + tmp) % 10);
	}
	if(kuriagari) s += '1';
	reverse(s.begin(), s.end());
	return s;
}

int main(){
	int t;
	cin >> t;
	cin.ignore();
	while(t--){
		string s;
		getline(cin, s);
		vector<pair<int, int>> vp;	//place, length
		for(int i = 0, prev = 0; i < s.size(); i++){
			if('0' <= s[i] && s[i] <= '9'){
				if(prev == 0) vp.emplace_back(make_pair(i, 1));
				else vp.rbegin()->second++;
				prev++;
			}else prev = 0;
		}
		if(vp.empty()) cout << s << endl;
		else{
			pair<int, int> p = *vp.rbegin();
			string puni = straddone(s.substr(p.first, p.second));
			s.replace(p.first, p.second, puni);
			cout << s << endl;
		}
	}
}