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.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	private static int n;
	
	 public static void main(String args[]) throws Exception {
	        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

	        n = Integer.parseInt(br.readLine());
	        
	        for(int j=0;j<n;j++){
	        	String line = br.readLine();
	        	char[] s = line.toCharArray();
	        	Arrays.sort(s);
	        	char[] rev = new char[s.length];

	        	for(int i=0;i<s.length;i++){
	        		rev[i] = s[s.length-i-1];
	        	}
	        	int a = Integer.parseInt(String.valueOf(s));
	        	int b = Integer.parseInt(String.valueOf(rev));
	        	System.out.println(b-a);
	        }	 
	    }
}