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

class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());

        for (int i = 0; i < n; i++) {
            int now = Integer.parseInt(br.readLine());
            int[] arr = new int[8];
            for (int j = 0; j < 8; j++) {
                arr[j] = now % 10;
                now /= 10;
            }
            Arrays.sort(arr);

            int down = 10000000;
            int up = 1;

            int bigger = 0;
            int smaller = 0;

            for (int j = 0; j < 8; j++) {
                bigger += up * arr[j];
                smaller += down * arr[j];

                down /= 10;
                up *= 10;
            }

            System.out.println((bigger - smaller));
        }
    }
}
