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.io.*;
import java.util.*;

class Main {
	
	public static int[] rev_array(int[] array) {
		
		int[] res = new int[array.length];
		int j = 0;
		for (int i = array.length - 1; i >= 0; i--) {
			res[j++] = array[i];
		}
		return res;
	}
	
	public static int array_to_num (int[] num) {
		
		String str = "";
		for (int n : num) {
			str += String.valueOf(n);
		}
		return Integer.parseInt(str);
		
	}
	
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = 
			new BufferedReader(new InputStreamReader(System.in));
		
		ArrayList<Integer> ans = new ArrayList<Integer>();
		
		int n = Integer.parseInt(br.readLine());
		for (int i = 0; i < n; i++) {
			
			String str = br.readLine();
			char[] c = str.toCharArray();
			int[] num  = new int[c.length];
			for (int j = 0; j < c.length; j++) {
				num[j] = c[j] - '0';
			}
			Arrays.sort(num);
			int[] num2 = rev_array(num);
			ans.add(array_to_num(num2) - array_to_num(num));
			
		}
		
		for (int a : ans)
			System.out.println(a);
		
	}
	
}