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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str = br.readLine();
		int n = Integer.parseInt(str);

		for(int i=0; i<n; i++){
			System.out.println(dif(br.readLine()));
		}

	}

	static int dif(String st){
		char data[] = st.toCharArray();
		Arrays.sort(data);
		String big="",small="";
		int B,S;

		for(int i=0; i<data.length; i++){
			small += data[i];
		}

		for(int j=data.length-1; j>-1; j--){
			big += data[j];
		}

		B = Integer.parseInt(big);
		S = Integer.parseInt(small);

		return B-S;
	}
}