#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=998244353;
void solve() {
string s;
cin >> s;
for(int i=0;i<s.size();++i){
int best =s[i]-'0';
int k=i;
for(int j=i;j<min(i+10,(int)s.size());j++){
if(s[j]-'0'-j+i>best){
best=s[j]-'0'-j+i;
k=j;
}
}
while(k>i){
swap(s[k],s[k--]);
}
s[i]=char(best+'0');
}
cout << s << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTk5ODI0NDM1MzsKCnZvaWQgc29sdmUoKSB7CgogICAgc3RyaW5nIHM7CiAgICBjaW4gPj4gczsKCiAgICBmb3IoaW50IGk9MDtpPHMuc2l6ZSgpOysraSl7CiAgICAgICAgaW50IGJlc3QgPXNbaV0tJzAnOwogICAgICAgIGludCBrPWk7CiAgICAgICAgZm9yKGludCBqPWk7ajxtaW4oaSsxMCwoaW50KXMuc2l6ZSgpKTtqKyspewogICAgICAgICAgICBpZihzW2pdLScwJy1qK2k+YmVzdCl7CiAgICAgICAgICAgICAgICBiZXN0PXNbal0tJzAnLWoraTsKICAgICAgICAgICAgICAgIGs9ajsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICAgd2hpbGUoaz5pKXsKICAgICAgICAgICAgc3dhcChzW2tdLHNbay0tXSk7CiAgICAgICAgIH0KICAgICAgICAgc1tpXT1jaGFyKGJlc3QrJzAnKTsKICAgIH0KICAgIGNvdXQgPDwgcyA8PCAnXG4nOwp9CgppbnQgbWFpbigpeyAKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUobnVsbHB0cik7CgkKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgCgogICAgcmV0dXJuIDA7Cn0K