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>

using namespace std;

int main(void){
  vector<int>num;
  char ch[10];
  int n,maxn,minn;

  cin >> n;
  cin.ignore();
  while(n--){
    scanf("%[^\n]%*c",ch);

 for(int i=0;i<8;i++)num.push_back(ch[i]-'0');
      
    sort(num.begin(),num.end(),greater<int>());
 
    maxn=0;
    for(int i=0;i<8;i++)
      maxn*=10,maxn+=num[i];

    sort(num.begin(),num.end());

    minn=0;
    for(int i=0;i<8;i++)
      minn*=10,minn+=num[i];

    cout << maxn-minn << endl;
    num.clear();
  }

  return 0;
}