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
/**
 * @author yuichirw
 *
 */
import java.util.*;
import static java.util.Arrays.*;
public class Main {
	static int 		n;
	static char[] 	num;
	static Scanner 	sc = new Scanner(System.in);
	
	static boolean read() {
		num = sc.nextLine().toCharArray();
		return true;
	}
	
	static String solve() {
		sort(num);
		String max, min;
		max = ""; min = "";
		for(int i = 0; i < num.length; i++) {
			min += num[i];
			max += num[num.length - 1 - i];
		}
		return new Long(Long.parseLong(max) - Long.parseLong(min)).toString();		
	}
	
	public static void main(String[] args) {
		n = sc.nextInt(); sc.nextLine();
		while(n-- > 0 && read()) {
			System.out.println(solve());
		}
	}
}