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.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);

		int n = stdIn.nextInt();
		for(int i=0;i<n;i++){
			String a = stdIn.next();
			char[] b = new char[10];
			b=a.toCharArray();
			Arrays.sort(b);
			String c = String.valueOf(b);
			int min = Integer.parseInt(c);
			int max = 0;
			for(int j=0;j<8;j++){
				max*=10;
				max+=b[7-j]-'0';
			}
			System.out.println(max-min);
		}
	}
}