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 input = new Scanner(System.in);
		int n, seq, tmp;
		int i, j, res;
		int num[] = new int[10];
		
		n = input.nextInt();
		for (; n > 0; n--){
			seq = input.nextInt();
			for (i = 0; i < 8; i++){
				num[i] = seq % 10;
				seq /= 10;
			}
			for (i = 0; i < 7; i++){
				for (j = i + 1; j < 8; j++){
					if (num[i] > num[j]){
						tmp = num[i];
						num[i] = num[j];
						num[j] = tmp;
					}
				}
			}
			res = 0;
			for (i = 0; i < 8; i++){
				res *= 10;
				res += (num[7 - i] - num[i]);
			}
			System.out.println(res);
		}
	}
}