#include <iostream>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
const int N =1e4 +5;
const int M = 1e9 +7;
const int inf = 0x3fffffff;
void solve(){
	string a;
	cin>>a;
	int n=a.size();
	cout<<a[0];
	int f=0;
	char c;
	for(int i=1;i<n;i++){
		if(f==0){
			if(a[i]>=a[i-1]){
				cout<<a[i];
			}
			else{
				cout<<a[i];
				f=1;
			}
		}
		else if(f==1){
			if(a[i]<=a[i-1]){
				cout<<a[i];
			}
			else{
				cout<<a[i-1];
				c=a[i-1];
				f=2;
			}
		}
		else if(f==2){
			cout<<c;
		}
	}
	cout<<"\n";
}
int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    int t;cin>>t;while(t--)
    solve();
    return 0;
}