#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"

using namespace std;
const int N = 2e5 + 69;
int n;
int perm[N], dep[N];
int l;
vector<vector<int>> adj;
int timer;
vector<int> tin, tout;
vector<vector<int>> up;

void dfs(int v, int p) {
    tin[v] = ++timer;
    dep[v] = dep[p] + 1;
    up[v][0] = p;
    for (int i = 1; i <= l; ++i)
        up[v][i] = up[up[v][i - 1]][i - 1];

    for (int u: adj[v]) {
        if (u != p)
            dfs(u, v);
    }
    tout[v] = ++timer;
}

bool is_ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int lca(int u, int v) {
    if (is_ancestor(u, v))
        return u;
    if (is_ancestor(v, u))
        return v;
    for (int i = l; i >= 0; --i) {
        if (!is_ancestor(up[u][i], v))
            u = up[u][i];
    }
    return up[u][0];
}

void preprocess(int root) {
    tin.resize(n + 69);
    tout.resize(n + 69);
    timer = 0;
    l = ceil(log2(n + 69));
    up.assign(n + 69, vector<int>(l + 1));
    dfs(root, root);
}

int dis(int u, int v) {
    return dep[u] + dep[v] - dep[lca(u, v)] * 2;
}

signed main() {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int T;
    cin >> T;
    while (T--) {
        string s;
        cin >> s;
        int i = 0, n = s.size();
        while (i < n and s[i] <= s[i + 1])
            i++;
        int ck = i - 1;
        for (i = ck + 1; i < n - 1; i++)
            if (s[i] < s[i + 1])break;
        ck = i;
        for (int i = 0; i < ck; i++)cout << s[i];
        for (int i = ck; i < n; i++)cout << s[ck];
        cout << endl;
    }
}