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
import java.util.Scanner;

class Main {
	public static void main(String args[]){
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		
		for(int i=0;i<n;i++){
			String str = new String();
			str = scan.next();
			char[] num = str.toCharArray();
			char[] max = new char[str.length()];
			char[] min = new char[str.length()];
			int index = 0;
			
			
			for(int j=57;j>=48;j--){
				for(int k=0;k<str.length();k++){
					if(num[k] == j){
						max[index] = num[k];
						index++;
					}
				}
			}
			
			index = 0;
			for(int j=48;j<=57;j++){
				for(int k=0;k<str.length();k++){
					if(num[k] == (char)j){
						min[index] = num[k];
						index++;
					}
				}
			}
			
			String maxStr = String.valueOf(max);
			String minStr = String.valueOf(min);
			int maxNum = Integer.parseInt(maxStr);
			int minNum = Integer.parseInt(minStr);
			
			System.out.println((maxNum-minNum));
		}
	}
}