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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int n = Integer.parseInt(br.readLine());
				
		for(int i = 0; i < n; i++){
			MaxMinManager mg = new MaxMinManager(br.readLine());
			
			System.out.println(mg.difference());
		}

	}

}

class MaxMinManager {
	int max;
	int min;
	
	public MaxMinManager(String str){
		char[] carray = str.toCharArray();
		
		max = generateMax(carray);
		min = generateMin(carray);
	}
	
	private int generateMax(char[] carray){
		StringBuffer sb = new StringBuffer();
		Arrays.sort(carray);
		sb.append(carray);
		sb.reverse();
//		System.out.println("sorted Max"+sb.toString());
		
		return Integer.parseInt(sb.toString());
	}
	
	private int generateMin(char[] carray){
		Arrays.sort(carray);
//		System.out.println("sorted Min"+new String(carray));
		return Integer.parseInt(new String(carray));
	}
	
	public int difference(){
		return max - min;
	}
}