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) {
		new Main().solve();
	}
	
	void solve(){
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		for(int i=0; i<n; ++i){
			int V = 0, M = 1000000000;
			
			char[] str = sc.next().toCharArray();
			Arrays.sort(str);
			char[] rts = new char[str.length];
			for(int j=0; j<str.length; ++j){
				rts[j] = str[str.length - j -1];
			}
			
			int v = Integer.parseInt(new String(rts));
			int m = Integer.parseInt(new String(str));
			V = Math.max(v, V);
			M = Math.min(m, M);
			
			System.out.println(Math.abs(V-M));
		}
	}
	
	void debug(Object... os){
		System.err.println(Arrays.deepToString(os));
	}
}