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 = null;
		try {
			sc = new Scanner(System.in);
			while (sc.hasNextInt()) {
				int dataSet = sc.nextInt();
				for (int i = 0; i < dataSet; i++) {
					String originalNum = sc.next();
					char[] charNum = originalNum.toCharArray();

					// asc
					Arrays.sort(charNum);
					int ascNum = Integer.parseInt(String.valueOf(charNum));

					// desc
					int descNum = Integer.parseInt(String
							.valueOf(desc(charNum)));

					// max-min
					int result = descNum - ascNum;
					System.out.println(result);
				}
			}
		} finally {
			sc.close();
		}
	}

	public static char[] desc(char[] c) {
		char[] after = new char[c.length];

		for (int i = 0; i < c.length; i++) {
			after[i] = c[c.length - (1 + i)];
		}
		return after;
	}
}