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 sc = new Scanner(System.in);
		List<Integer> al = new ArrayList<>();
		
		int in, tmp = sc.nextInt();
		String asc = "", desc = "";
		String[] sort;
		
		for(int i = 0; i < tmp; i++) {
			in = sc.nextInt();
			sort = String.valueOf(in).split("");
			
			Arrays.sort(sort);
			
			for(int j = 0; j < sort.length; j++) {
				asc += sort[j];
			}
			
			for(int j = sort.length - 1; j >= 0; j--) {
				desc += sort[j];
			}
			
			al.add(Integer.parseInt(desc) - Integer.parseInt(asc));
			
			asc = "";
			desc = "";
		}
		
		
		for(int i : al) {
			System.out.println(i);
		}
	}
}