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 arg[])
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[8];

		while(n>0)
		{ 
			String  b = sc.next();
			int max =0;
			int min =0;
			int sum=0;
			for(int i=0; i<8; i++)
			{
				a[i]=Integer.valueOf(b.charAt(i))-48;
			}
			Arrays.sort(a);
			for(int i=1; i<= 8; i++)
			{
				max += a[i-1]* fact(i);	
			}
			for(int i=7;i>=0; i--)
			{
				min +=a[i]*fact(8-i);
			}
			System.out.println(max-min);
			n--;
		}
	}
	public static int fact(int n)
	{
		if(n == 1)
			return 1;
		return fact(n-1)*10;
	}


}