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 Scanner sc = new Scanner(System.in);
	static String line;
	public static void main(String[] args){
		while(read()){

		}
	}
	static boolean read(){
		if(!sc.hasNext())return false;

		int n = sc.nextInt();
		for(int i = 0; i < n; i++){
			line = sc.next();
			solve();
		}
		return true;
	}
	static void solve(){
		char[] number = new char[8];
		number = line.toCharArray();
		java.util.Arrays.sort(number);
		int minValue = Integer.parseInt(new String(number));
		char[] m = new char[8];
		for(int i = 0; i < number.length; i++){
			m[i] = number[7 - i];
		}
		int maxValue = Integer.parseInt(new String(m));
		System.out.println(maxValue - minValue);
	}
}