#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d1(a)cout<<#a<<": "<<a<<"\n";
#define d2(a,b)cout<<#a<<": "<<a<<" , "<<#b<<": "<<b<<"\n";
#define d3(a,b,c)cout<<#a<<": "<<a<<" , "<<#b<<": "<<b<<" , "<<#c<<": "<<c<<"\n";
#define d4(a,b,c,d)cout<<#a<<": "<<a<<" , "<<#b<<": "<<b<<" , "<<#c<<": "<<c<<" , "<<#d<<": "<<d<<"\n";
int solve(int n) {
string s = to_string(n);
string mx = s, mn = s;
string cp;
for (int i = 0; i <= 9; i++) {
cp = s;
for (int j = 0; j < cp.size(); j++) {
if (cp[j] - '0' == i) {
cp[j] = char(9 + '0');
}
}
mx = max(mx, cp);
}
int val = 0;
for (int i = 0; i <= 9; i++) {
cp = s;
val = 0;
if (i == cp[0] - '0') {
val = 1;
}
for (int j = 0; j < cp.size(); j++) {
if (cp[j] - '0' == i) {
cp[j] = char(val + '0');
}
}
mn = min(mn, cp);
}
return stoi(mx) - stoi(mn);
}
int main() {
int n;
int t;
cin >> t;
while (t--) {
cin >> n;
cout << solve(n) << endl;
}
return 0;
}