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>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
 
int main() {
	int n; cin >> n;
	rep(i,0,n) {
		int a[8];
		rep(j,0,8) scanf("%1d",&a[j]);

		int big = 0; int small = 0;
		sort(a, a+8);
		rep(j,0,8) {
			small += a[j] * pow(10,7-j);
			big += a[7-j] * pow(10,7-j);
		}

		cout << big - small << endl;
	}
    return 0;
}