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

int main(){
  int n;cin>>n;
  for(int j=0;j<n;++j){
    vector<char> a(8);
    for(int i=0;i<8;++i){
      cin>>a[i];
    }
    vector<char> b=a;
    sort(begin(a),end(a),greater<char>());
    sort(begin(b),end(b));

    string max_(a.begin(),a.end()),min_(b.begin(),b.end());
    cout << stoi(max_) - stoi(min_) << endl;
  }
  return 0;
}