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.*;

class Main {
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i=0; i<n ; i++){
            int number = scanner.nextInt();
            List<Integer> arrayNumber = new ArrayList<>();

            while (number != 0){
                arrayNumber.add(number % 10) ;
                number /= 10;
            }
            Collections.sort(arrayNumber);
            int min = calculate(arrayNumber);
            Collections.sort(arrayNumber, Collections.reverseOrder());
            int max = calculate(arrayNumber);
            System.out.println(max - min);
        }
    }

    static int calculate (List<Integer> arr){
        int size = arr.size();
        int result = 0;
        for (int i= 0; i<size; i++){
            result += arr.get(size-i-1) * Math.pow(10, i );
        }
        return result;
    }

}

