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.Scanner;

public class Main {

	static Scanner scan = new Scanner(System.in);
	static PrintWriter out = new PrintWriter(System.out);

	public static void main(String[] args) {
		int n = si();
		while(n-->0){
			char[] mozi = scan.next().toCharArray();
			Arrays.sort(mozi);
			String min = "",max = "";
			for (int i = 0; i < mozi.length; i++){
				min+=mozi[i];
				max=mozi[i]+max;
			}
			out.println(Integer.parseInt(max)-Integer.parseInt(min));
		}
		out.flush();
	}

	static int si() {
		return Integer.parseInt(scan.next());
	}
}