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>
using namespace std;

int main(){
	
	int n,a;
	int S[10];
	char s[10];
	
	cin>>n;
	while(n!=0){
		cin>>s;
		for(int i=0;i<8;i++)
			S[i]=s[i]-'0';
		
		int max=0,min=0;
		sort(S,S+8);
		for(int i=0;i<8;i++){
			if(S[7-i]==0){
				if(max!=0)
					max=max*10;
			}
			else
				max=max*10+S[7-i];
			if(S[i]==0){
				if(min!=0)
					min=min*10;
			}
			else min=min*10+S[i];
			}
		cout<<max-min<<endl;
		n--;
	}
		

}