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 <cstring>
#include <algorithm>
#include <sstream>
using namespace std;

int toInt(const char *s){
	stringstream ss;int x;
	ss<<s;
	ss>>x;
	return x;
}

int main(void){
  int n,a,b;
  string num;
  cin>>n;
  while(n--){
  	char *s=(char *)malloc(9*sizeof(char));
  	cin>>num;
  	while(num.size()!=8) num="0"+num;
  	s=strcpy(s,num.c_str());
  	sort(s,s+8);
  	a=toInt(s);
  	sort(s,s+8,greater<char>());
  	b=toInt(s);
  	cout<<b-a<<endl;
  	free(s);
  }
  return 0;
}