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<string>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
  int n;
  string s;
  cin>>n;
  for(int i=0; i<n; i++) {
    cin>>s;
    vector<char> v;
    for(int j=0; j<s.length(); j++)
      v.push_back(s[j]);
    sort(v.begin(), v.end());
    string min,max;
    for(int j=0; j<v.size(); j++) {
      min += string(1,v[j]);
      max += string(1,v[v.size()-j-1]);
    }
    int ma=atoi(max.c_str()),mi=atoi(min.c_str());
    cout<<ma-mi<<endl;
  }
}