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 scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		
		for(int m=0; m<n; m++)
		{
			String input = scanner.next();					
			int[] num = new int[8];
			
			for(int i=0; i<8; i++)
			{
				num[i] = Integer.parseInt(input.substring(i, i+1));
			}
			
			for(int i=0; i<8; i++)
			{
				for(int j=0; j<8; j++)
				{
					if(num[i] < num[j])
					{
						int buf = num[i];
						num[i] = num[j];
						num[j] = buf;
					}
				}
			}
			
			String min = "";
			String max = "";
			for(int i=0; i<8; i++)
			{
				min += num[i];
				max += num[7-i];
			}
			
			System.out.println(Integer.parseInt(max) - Integer.parseInt(min));
		}
	}
}