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.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String n = sc.nextLine() ;
		for(int i = 0 ; i < Integer.parseInt(n); i++){
			String str = sc.nextLine();
			String[] stra = str.split("");
 			Arrays.sort(stra);
 			String buff = new String();
 			for(int j = 0 ; j < stra.length ; j++){
 				if(!("0".equals(stra[j]))){
 					buff += stra[j];
 				}
 			}
 			
 			if(buff.length() == 0) buff = "0";
 			
 			int min = Integer.parseInt(buff);
 			String[] strb = str.split("");
 			buff = new String();
 			Arrays.sort(strb,Collections.reverseOrder());
 			for(int k = 0 ; k < strb.length ; k++){
 				buff += strb[k];
 			}
 			int max = Integer.parseInt(buff);
 			System.out.println(max - min);
		}
		sc.close();
	}
}