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;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n;
		String str;
		int a[];
		int max;
		int min;

		n = sc.nextInt();
		a = new int[8];
		for (int i = 0; i < n; i++) {
			max = 0;
			min = 0;
			str = sc.next();
			for (int j = 0; j < 8; j++) {
				a[j] = str.charAt(j);
			}
			for (int j = 0; j < 8; j++) {
				int maxIndex = j;
				for (int k = j; k < 8; k++) {
					if (a[maxIndex] < a[k]) {
						maxIndex= k;
					}
				}
				int swap = a[maxIndex];
				a[maxIndex] = a[j];
				a[j] = swap;
			}
			for (int j = 0; j < 8; j++) {
				max *= 10;
				max += a[j];
			}
			for (int j = 7; 0 <= j; j--) {
				min *= 10;
				min += a[j];
			}
			System.out.println(max - min);
		}
	}
}