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<algorithm>
#include<functional>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
  int a;
  cin>>a;
  for(int i=0;i<a;i++){
    string numStr;
    int max=0; int min=0;
    cin>>numStr;
    int num[8];
    for(int j=0;j<8;j++){
      num[j]=numStr[j]-'0';
    }
    sort(num,num+8);
    for(int j=0;j<8;j++){
      max+=num[j]*pow(10.0,(double)j);
    }
    sort(num,num+8,greater<int>());
    for(int j=0;j<8;j++){
       min+=num[j]*pow(10.0,(double)j);
    }
    cout<<max-min<<endl;
  }
}