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
{
	static final Scanner s = new Scanner(System.in);

	public static void main(String... args)
	{
		int num = Integer.parseInt(s.nextLine());
		for(int i = 0; i < num; i++)
		{
			char[] arr = s.nextLine().toCharArray();
			Arrays.sort(arr);
			int min = Integer.parseInt(new String(arr));
			reverse(arr);
			int max = Integer.parseInt(new String(arr));
			System.out.println(max - min);
		}
	}
	
	static void reverse(char[] arr)
	{
		int l = arr.length;
		for(int i = 0; i < arr.length / 2; i++)
		{
			char tmp = arr[i];
			arr[i] = arr[l - i - 1];
			arr[l - i - 1] = tmp;
		}
	}
}