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;

public class Main {

	public static void main(String[] args) {
		int[] abo = {0,0,0,0};
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String tmp = null;
		int cup = 0;
		int mun = 0;
		int ter = 0;
		String[] rrr;
		int st = 0,sr = 0;
		int mon = 0;
		int syo=0,hisi=0;
		char[] ccc,ddd;
		
		
		try {
			tmp = br.readLine();
		} catch (IOException e1) {
			// TODO 自動生成された catch ブロック
			e1.printStackTrace();
		}
		mun = Integer.parseInt(tmp);
		
		int tmo;
		
		for(int i=0;i<mun;i++){
			
			try {
				tmp = br.readLine();
			} catch (IOException e) {
				// TODO 自動生成された catch ブロック
				e.printStackTrace();
			}
			ccc = new char[tmp.length()];
			ddd = new char[tmp.length()];
			for(int j=0;j<tmp.length();j++){
				ccc[j] = tmp.charAt(j);
				ddd[j] = tmp.charAt(j);
			}
			
			for(int s=0;s<ccc.length;s++){
				for(int j=0;j<ccc.length;j++){
					if(ccc[s] < ccc[j]){
						tmo = ccc[s];
						ccc[s] = ccc[j];
						ccc[j] = (char) tmo;
					}
					if(ddd[s] > ddd[j]){
						tmo = ddd[s];
						ddd[s] = ddd[j];
						ddd[j] = (char) tmo;
					}
				}
			}
			String tyu = String.valueOf(ccc);
			String ghj = String.valueOf(ddd);
			System.out.println((Integer.parseInt(ghj) - Integer.parseInt(tyu)));
		}

	}

}