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 {

    static int toInt (ArrayList<Integer> data) {
        int result = 0;
        int mult = 1;
        
        for (int i = 7; i >= 0; i--) {
            result += data.get(i) * mult;
            mult *= 10;
        }
        return result;
    }

    static void solve (ArrayList<Integer> data) {
        int max, min;

        Collections.sort(data);
        min = toInt(data);
        Collections.reverse(data);
        max = toInt(data);

        System.out.println(max - min);
    }

    public static void main (String [] args) {

        Scanner sc = new Scanner(System.in);
        sc.nextLine();

        while (sc.hasNext()) {
            String line = sc.nextLine();
            ArrayList<Integer> data = new ArrayList<Integer>();

            for(int i = 0; i < 8; i++) {
                data.add(Integer.parseInt(line.substring(i,i+1)));
            }

            solve(data);
        }
            
                
    }
}