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;


public class Main {
	public static void main(String[] args){
		Scanner scan = null;
		try{
			scan = new Scanner(System.in);
			int n = scan.nextInt();
			for(int i = 0 ; i < n;i++){
				char[] data = scan.next().toCharArray();
				int[] num = new int[data.length];
				for(int j = 0 ; j < data.length;j++){
					num[j] = Integer.parseInt(String.valueOf(data[j]));
				}
				Arrays.sort(num);
				int ans = 0;
				for(int j = 0 ;j < num.length;j++){
					ans += num[j] * Math.pow(10, j);
					ans -= num[j] * Math.pow(10, 7 -j);
				}
				System.out.println(ans);
			}
		}finally{
			if(scan !=null)scan.close();
		}
	}
}