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

int n;
int nums[8];

int main() {
  scanf("%d", &n);
  while (n--) {
    for (int i=0; i<8; i++) {
      scanf("%1d", &nums[i]);
    }
    sort(nums, nums+8);

    int mini = 0;
    for (int i=0; i<8; i++) {
      mini = mini*10 + nums[i];
    }

    sort(nums, nums+8, greater<int>());

    int maxi = 0;
    for (int i=0; i<8; i++) {
      maxi = maxi*10 + nums[i];
    }

    printf("%d\n", maxi-mini);
  }
}