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
// 2011/03/24 Tazoe

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int n;
	cin >> n;

	for(int i=0; i<n; i++){
		string str;
		cin >> str;

		for(int j=0; j<7; j++)
			for(int k=j+1; k<8; k++)
				if(str[j]<str[k]){
					char tmp = str[j];
					str[j] = str[k];
					str[k] = tmp;
				}

		int max = 0;
		for(int j=0; j<8; j++)
			max = max*10+(str[j]-'0');

		int min = 0;
		for(int j=7; j>=0; j--)
			min = min*10+(str[j]-'0');

		cout << max-min << endl;
	}

	return 0;
}