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 <stdio.h>
#include <stdlib.h>

int main(void) {
  char s[15], t;
  long long i, j, k, n;
  scanf("%lld", &n);
  for(i = 0; i < n; ++i) {
    long long min, max;
    scanf("%s", s);
    for(j = 0; j < 8; ++j) for(k = j + 1; k < 8; ++k) if(s[j] > s[k]) t = s[j], s[j] = s[k], s[k] = t;
    min = atoll(s);
    for(j = 0; j < 8; ++j) for(k = j + 1; k < 8; ++k) if(s[j] < s[k]) t = s[j], s[j] = s[k], s[k] = t;
     max = atoll(s);
     printf("%lld\n", max - min);
  }
}
