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 in = new Scanner(System.in);
		int n = in.nextInt();
		for (int i = 0; i < n; i++) {
			char[] carray = in.next().toCharArray();
			Arrays.sort(carray);
			int max = 0;
			int min = 0;
			for (int j = 0; j < 8; j++) {
				int val = Character.getNumericValue(carray[j]);
				min += (int) Math.pow(10, (7 - j)) * val;
				max += (int) Math.pow(10, j) * val;
			}
			System.out.println(max - min);
		}
	}
}