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);
		List<Integer> result = new ArrayList<Integer>();
		
		int T = stdIn.nextInt();
		for(int i = 0; i < T; i++){
			String str = stdIn.next();
			int[] data = new int[10];
			for(int j = 0; j < str.length(); j++){
				data[(int)(str.charAt(j)-'0')]++;
			}
			StringBuilder sb = new StringBuilder();
			for(int j = 9; j >= 0; j--){
				while( data[j]-- > 0 ){
					sb.append(Integer.toString(j));
				}
			}
			int max = Integer.parseInt(sb.toString());
			sb.reverse();	
			int min = Integer.parseInt(sb.toString());
			result.add(max-min);
		}
		for(Integer num : result){
			System.out.println(num);
		}
	}
}