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 <iostream>
#include <algorithm>

using namespace std;

int dif(int a){
  int n[20],dig,b=0;
    for(dig = 0;a>0;a/=10,dig++)
      n[dig] = a%10;
    sort(n,n+dig);
    for(int j=dig-1;j>=0;j--){
      b *= 10;
      b += n[j]%10;
    }
    reverse(n,n+dig);
    for(int j=dig-1;j>=0;j--){
      a *= 10;
      a += n[j]%10;
    }
    return b-a;
}

int main(){
  int a,n;
  for(cin>>n;n>0;n--){
  cin >> a;
  cout << dif(a) << endl;
  }
  return 0;
}