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
//0051
#include <bits/stdc++.h>
using namespace std;

int main(){
	string str;
	int n,a[8],i,max,min;
	cin>>n;
	while(n--){
		max = 0; min = 0;
		cin>>str;
		for(i = 0;i < 8;i++){
			a[i] = str[i] - '0';
		}

		sort(a,a+8,greater<int>());
		for(i = 0;i < 8;i++){
			max += a[i] * pow(10,7-i);
		}
		sort(a,a+8);
		for(i = 0;i < 8;i++){
			min += a[i] * pow(10,7-i);
		}
		cout<<max-min<<endl;
	}
	return 0;
}