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
#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
  int n, m, M;
  int d[8];
  char c;
  scanf("%d\n", &n);
  for (int i=0; i<n; i++) {
    for(int j=0; j<8; j++) {
      scanf("%c", &c);
      d[j] = c - '0';
    }
    getchar();
    sort(d, d+8);
    m = 0;
    M = 0;
    for (int j=0; j<8; j++) {
      m *= 10;
      M *= 10;
      m += d[j];
      M += d[7-j];
    }
    printf("%d\n", M-m);
  }
  return 0;
}