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>
#include <vector>
using namespace std;
int main(){
  int n, k;
  cin >> n;
  while(n--){
    vector<int> p, q;
    int u=0, v=0;
    cin >> k;
    for(int i=0; i<8; i++){
      p.push_back(k%10);
      k/=10;
    }
    sort(p.begin(),p.end());
    q.resize(8);
    for(int i=0; i<8; i++)
      q[7-i] = p[i];
    int sep = 1;
    for(int i=0; i<8; i++){
      u+= sep*p[i];
      v+= sep*q[i];
      sep*=10;
    }
    cout << u-v << endl;
  }
  return 0;
}