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.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 0; i < n ;i++){
			char [] temp = sc.next().toCharArray();
			int num[] = new int[temp.length];
			for(int j = 0; j < temp.length; j++){
				num[j] = temp[j] -'0';
			}
			Arrays.sort(num);
			String ans = "";
			for(int j:num){
				ans += String.valueOf(j);
			}
			StringBuilder sb = new StringBuilder(ans);
			System.out.println(Integer.parseInt(sb.reverse().toString())-Integer.parseInt(ans));
		}
	}
}