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 static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		while(n>0){
			String w = sc.next();
			int t = Integer.parseInt(w);
			int[] a = new int[8];
			for(int i=0; i<8; i++){ a[i] = t%10; t /= 10;}
			Arrays.sort(a);
			String min = a[0] +""+ a[1] +""+ a[2] +""+ a[3] +""+ a[4] +""+ a[5] +""+ a[6]+""+ a[7];
			String max = a[7] +""+ a[6] +""+ a[5] +""+ a[4] +""+ a[3] +""+ a[2] +""+ a[1]+""+ a[0];
			System.out.println(Long.parseLong(max)-Long.parseLong(min));
			n--;
		
		}
	}

}