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.Scanner;
import java.util.Arrays;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int[] a = {10000000,1000000,100000,10000,1000,100,10,1};
        while(scan.hasNext()){
            int n = scan.nextInt();
        	for(int k = 0;k < n;k++){
        		char[] ch = scan.next().toCharArray();
        		Arrays.sort(ch);
        		int b = 0;
        		for(int i = 0,j = 7;i < 8;i++,j--){
        			b += (Integer.parseInt(ch[j]+"") - Integer.parseInt(ch[i]+""))*a[i];
        		}
        		System.out.println(b);
        	}
        }
    }
}