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);
        int n = sc.nextInt();
        //改行
        String a = sc.nextLine();
        
        Integer[] list = new Integer[8];
        
        for(int i = 0; i < n; i++) {
            String line = sc.nextLine();
            String[] linesp = line.split("");
            for(int j = 0; j < 8; j++) {
                list[j] = Integer.parseInt(linesp[j]);
            }
            Integer max = 0;
            int min = 0;
            Arrays.sort(list);
            int x = 0;
            for(int j = 10000000; j >= 1; j/=10) {
                min += list[x] * j;
                x++;
            }
            Arrays.sort(list, Collections.reverseOrder());
            x = 0;
            for(int j = 10000000; j >= 1; j/=10) {
                max += list[x] * j;
                x++;
            }
            System.out.println(max - min);
        }
    }
}

