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>
using namespace std;
int main()
{
	string a;
	char temp;
	int max,min,N;
	cin>>N;
	for(int i=0;i<N;i++){
		max=0;
		min=0;
		cin>>a;
		for(int k=0;k<8;k++){
			for(int j=0;j<8;j++){
				if(a[k]>a[j]){
					temp=a[j];
					a[j]=a[k];
					a[k]=temp;
				}
			}
			
		}
		for(int k=0;k<8;k++){
			max=max*10+a[7-k]-48;
			min=min*10+a[k]-48;
		}
		cout<<min-max<<endl;
	}	
	return 0;
}