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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;

class Main {

    public static void main(String[] args) throws IOException {
        doit(args, System.in, System.out);
    }

    static void doit(String[] args, InputStream in, PrintStream out)
            throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(in));
        int n = Integer.parseInt(reader.readLine());
        for (int i = 0; i < n; i++) {
            char[] numbers = reader.readLine().toCharArray();
            Arrays.sort(numbers);
            int minValue = 0;
            int maxValue = 0;
            int minDigit = 10000000;
            int maxDigit = 1;
            for (int j = 0; j < 8; j++) {
                int number = numbers[j] - '0';
                minValue += number * minDigit;
                maxValue += number * maxDigit;
                minDigit /= 10;
                maxDigit *= 10;
            }
            out.println(maxValue - minValue);
        }
    }
}