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);
			int dataSet = 0;
			char[] num = new char[8];
			Integer max = 0;
			Integer min = 0;
			Integer result = 0;

			while (sc.hasNext()) {
				dataSet = sc.nextInt();
				for (int i = 1; i <= dataSet; i++) {
					num = sc.next().toCharArray();

					max = sortDesc(num);
					min = sortAsc(num);
					result = max - min;

					System.out.println(result);
				}

			}

		} finally {
			sc.close();
		}

	}

	public static Integer sortAsc(char[] c) {

		Arrays.sort(c);
		return Integer.parseInt(String.valueOf(c));
	}

	public static Integer sortDesc(char[] c) {

		Arrays.sort(c);
		char[] result = new char[c.length];

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

		return Integer.parseInt(String.valueOf(result));

	}

}