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 {
  public static void main (String[] args) {
    Scanner scanner = new Scanner(System.in);
    int n = scanner.nextInt();
    String out = "";
    for (int ii = 0; ii < n; ii++) {
      String str = scanner.next();
      List<String> ascs = new ArrayList<String>();
      List<String> descs = new ArrayList<String>();
      String ascStr = "";
      String descStr = "";
      for (int jj = 0; jj < str.length(); jj++) {
        ascs.add(str.substring(jj, jj + 1));
        descs.add(str.substring(jj, jj + 1));
      }
      Collections.sort(ascs);
      Collections.sort(descs);
      Collections.reverse(descs);
      for (int jj = 0; jj < ascs.size(); jj++) {
        ascStr += ascs.get(jj);
        descStr += descs.get(jj);
      }
      out += (Integer.parseInt(descStr) - Integer.parseInt(ascStr)) + "\n";
    }
    System.out.print(out);
  }
}