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

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader reader =
                new BufferedReader(new InputStreamReader(System.in));
        int count = Integer.parseInt(reader.readLine());
        while (count-- > 0) {
            String input = reader.readLine();
            if (input == null) {
                break;
            }
            char[] temp = input.toCharArray();
            Arrays.sort(temp);
            char[] temp2 = new char[temp.length];
            for(int i = temp.length; i > 0; i--) {
                temp2[temp.length - i] = temp[i - 1];
            }
            int min = Integer.parseInt(String.valueOf(temp));
            int max = Integer.parseInt(String.valueOf(temp2));
            System.out.println(max - min);
        }
    }
}