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<iostream>
#include<string>
#include<algorithm>
using namespace std;

int main(){
	
	int N;
	string str;
	cin >> N;
	
	while(N--){
		cin >> str;
		for( int i=0 ; i<str.size() ; i++ ){
			for( int j=i+1 ; j<str.size() ; j++ ){
				if( str[i] < str[j] ) swap( str[i] , str[j] );
			}
		}
		
		int p = 1;
		int numA = 0 ,numB = 0;
		for( int i=0 ; i<str.size() ; i++ ){
			numA += (str[i]-'0')*p;
			numB += (str[str.size()-i-1]-'0')*p;
			p*=10;
		}
		
		cout << numB - numA << endl ;
	}
	
	return 0;
}