#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e5 + 7, mod = 1e9 + 7;
void doWork() {
    string s;
    cin >> s;
    cout << s[0];
    int idx =-1;
    for (int i = 1; i < s.size(); ++i) {
        if ( s[i] < s[i-1])
        {
            cout << s[i] ;
            for (int j = i+1; j < s.size(); ++j) {
                if ( idx != -1)
                    s[j] = s[idx];
                if (s[j] > s[j-1])
                    idx = j;
                s[j] = min(s[j-1],s[j]);
                cout << s[j];
            }
            break;
        }
        else
            cout << s[i];
    }
    cout << '\n';
}

int main() {
   // ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int tests = 1;
    cin >> tests;
    for (int i = 0; i < tests; ++i) {
        //cout << "Case #" << i+1 <<": ";
        doWork();
        //        if (i + 1 == tests)
        //            continue;
        //        cout << endl;
    }
}