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
//Differential ?
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;


ll into(int s[8]){
  ll sum=0;
  for(int i=0; i<8; i++){
    sum=sum*10+s[i];
  }
  return sum;
}

int main(){
  int n;
  cin>>n;
  while(n--){
    long long a, b;
    int s[8];
    for(int i=0; i<8; i++)scanf("%1d", &s[i]);
    sort(s, s+8);
    a=into(s);
    sort(s, s+8, greater<int>());
    b=into(s);
    cout<<b-a<<endl;
  }
  return 0;
}