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 {
	static List<Integer> henkan(String n){
		List<Integer> m = new ArrayList<Integer>();
		for(int i=0;i<n.length();i++)m.add(Integer.parseInt(n.charAt(i)+""));
		return m;
	}
	
	static int big (List<Integer> m){
		String a = "";
		Collections.sort(m);
		for(int s=m.size()-1;s>=0;s--)a+=m.get(s);
		return Integer.parseInt(a);
	}
	static int small (List<Integer> m){
		String a = "";
		Collections.sort(m);
		for(int s=0;s<m.size();s++)a+=m.get(s);
		return Integer.parseInt(a);
	}
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n=in.nextInt();
		for(int k=0;k<n;k++){
			String input = in.next();
			List<Integer> m = henkan(input);
			System.out.println(big(m)-small(m));
		}
	}
}