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 <stdio.h>
#include <math.h>
void swap(int *a,int *b);
int main(){
	int data[8];
	int i,j,n,num,max,min;
	scanf("%d",&n);
	while(n--){
		max=min=0;
		scanf("%d",&num);
		for(i=0;i<8;i++){
			data[i] = num%10;
			num /= 10;
		}
		for(i=0;i<8;i++){
			for(j=i;j<8;j++){
				if(data[j]>data[i]) swap(&data[i],&data[j]);
			}
		}
		for(i=0;i<8;i++){
			max += pow(10.0,7-(double)i)*(data[i]);
			min += pow(10.0,(double)i)*(data[i]);
		}
		printf("%d\n",max-min);

	}
	return 0;
}

void swap(int *a,int *b){
	int t;
	t = *a;
	*a = *b;
	*b = t;
}