When you enter 8 numbers from 0 to 9, write a program that outputs the difference between the largest integer and the smallest integer that can sort the 8 numbers. The number that can be sorted may start from 0, such as 00135569.



Input

Given multiple datasets. The number of datasets n (n ≤ 50) is given on the first line. Then n rows of data are given. Each data is a sequence of 8 numbers (0 to 9 numbers).

Output

For each dataset, output the difference between the largest and smallest integers that can be rearranged in the entered numbers on one line.

Example

Input

2
65539010
65539010


Output

96417531
96417531
#include <bits/stdc++.h>
using namespace std;

using db = double;
using ll = long long;
using vi = vector <int>;
#define op operator
#define pb push_back

int main() {
	ios :: sync_with_stdio(0);

	int n; cin >> n;
	while(n --) {
		string s; cin >> s;
		int p[8]; iota(p, p + 8, 0);
		int mi = stoi(s), ma = stoi(s);
		do {
			string t = "";
			for(int i = 0; i < 8; i ++)
				t += s[p[i]];
			mi = min(mi, stoi(t));
			ma = max(ma, stoi(t));
		} while(next_permutation(p, p + 8));
		cout << ma - mi << '\n';
	}

	return 0;
}