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 {
	private Scanner sc;
	
	public static void main(String[] args) {
		new Main();
	}
	
	public Main() {
		sc = new Scanner(System.in);
		
		int lines = Integer.parseInt(sc.nextLine());
		for (int i = 0; i < lines; i++) {
			String nico = sc.nextLine();
			
			int[] numbers = new int[nico.length()];
			for (int j = 0; j < nico.length(); j++) {
				numbers[j] = nico.charAt(j) - '0';
			}

			Arrays.sort(numbers);

			int min = 0;
			int max = 0;
			
			for (int j = 0; j < nico.length(); j++) {
				min = min * 10 + numbers[j];
				max = max * 10 + numbers[nico.length() - j - 1];
			}

			System.out.println(max - min);
		}
	}
}