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 {
	public Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		new Main();
	}
	public Main() {
		new aoj0051().doIt();
	}
	class aoj0051{
		int sum(int a[]){
			double result = 0;
			for(int i = 0;i < 8;i++){
				result = result + (a[7-i] - a[i])*Math.pow(10, 7-i);
			}
			int ans = (int) result;
			return ans;
		}
		void doIt(){
			int n = sc.nextInt();
			int a[] = new int [8];
			for(int i = 0;i < n;i++){
				String str = sc.next();
				char ctr[] = str.toCharArray();
				for(int j = 0;j < 8;j++)a[j] = Integer.parseInt(ctr[j]+"");
				Arrays.sort(a);
				System.out.println(sum(a));
			}
		}
	}
}