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);
         
        while(sc.hasNext()){
            int n = sc.nextInt();
            for(int k=0;k<n;k++){
                String s = sc.next();
                int[] num = new int[8];
 
                for(int i=0;i<8;i++){
                    num[i] = Integer.valueOf(s.substring(i,i+1));
                }
                Arrays.sort(num);
                int a = 0;
                int b = 0;
                int c = 1;
                for(int i=0;i<8;i++){
                    a += num[i]*c;
                    b += num[7-i]*c;
                    c *= 10;
                }
                System.out.println(a-b);
                 
            }
        }
     
    }   
}