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 {
	Scanner sc = new Scanner(System.in);
	void run() {
		int[] value = new int[8];
		int n = sc.nextInt();
		for(int i=0;i<n;i++) {
			String str = sc.next();
			for(int j=0;j<8;j++) {
				value[j] = (int) (str.charAt(j) - '0');
			}
			Arrays.sort(value);
			System.out.println(max(value) - min(value));
		}
		
	}
	int min(int[] value) {
		String max = "";
		for (int i: value) max += i;
		return Integer.parseInt(max);
	}
	
	int max(int[] value) {
		String min = "";
		for (int i=7;i>=0;i--) min += value[i];
		return Integer.parseInt(min);
	}
	
	public static void main(String[] args){
		new Main().run();
	}
	
}