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
//20
#include<iostream>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<functional>

using namespace std;

int main(){
  int n;
  cin>>n;
  while(n--){
    string s;
    cin>>s;
    string sl=s,sh=s;
    sort(sl.begin(),sl.end());
    sort(sh.begin(),sh.end(),greater<char>());
    cout<<atoi(sh.c_str())-atoi(sl.c_str())<<endl;
  }
  return 0;
}