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<string>
#include<iostream>
#include<cstdlib>
using namespace std;
int main(){

  long long n,ans;
  string str,str2;
  
  cin >> n;

  while(n--){

    cin >> str;
    str2 = str;

    for(int i=0;i<7;i++){
      for(int j=i+1;j<8;j++){
	if(str[i]<str[j]) swap(str[i],str[j]);
	if(str2[i]>str2[j]) swap(str2[i],str2[j]);
      }
    }

    cout << atoi(str.c_str())-atoi(str2.c_str()) << endl;
  }

  return (0);
}