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.Scanner;
class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int num[]=new int[8];
		for(int i = 0; i < n ; i++){
			int max=0,min=0;
			String str = sc.next();
			for(int j = 0; j < 8; j++){
				num[j]=Integer.parseInt(String.valueOf(str.charAt(j)));
			}
			Arrays.sort(num);
			for(int j = 0; j < 8; j++){
				max += num[j]*Math.pow(10, j);
				min += num[j]*Math.pow(10, 7-j);
				
			}
			System.out.println(max-=min);
		}
	}	
}