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.*;
public class Main 
{
	public static void main(String[] args) 
	{
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		while(n-- != 0)
		{
			int num = stdIn.nextInt();
			List<Integer> list = new ArrayList<Integer>();
			while(num != 0)
			{
				list.add(num % 10);
				num /= 10;
			}
			Collections.sort(list);
			int max = 0, min = 0;
			for(int i = list.size() - 1; i >= 0; --i)
			{
				max *= 10;
				max += list.get(i);
			}
			for(int i = 0; i < list.size(); ++i)
			{
				min *= 10;
				min += list.get(i);
			}
			System.out.println(max - min);
		}
	}
}