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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line = "";

		while ((line = br.readLine()) != null) {
			if (line.length() > 1) {

				char[] nums = new char[10];
				int n, min, max;
				String minstr = "", maxstr = "";

				for (int i = 0; i < 8; i++) {
					n = Integer.parseInt(String.valueOf(line.charAt(i)));
					nums[n]++;
				}

				for (int i = 9; i >= 0; i--) {
					if (nums[i] > 0) {
						for (int j = 1; j <= nums[i]; j++) {
							maxstr += String.valueOf(i);
						}
					}
				}
				for (int i = 7; i >= 0; i--) {
					minstr += String.valueOf(maxstr.charAt(i));
				}
				max = Integer.valueOf(maxstr);
				min = Integer.valueOf(minstr);
				System.out.println(max - min);
			}

		}
	}
}