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<cstdio>
#include<algorithm>
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	while(n--){
		int num[8];
		for(int i=0; i<8; i++){scanf("%1d",&num[i]);}
		sort(num,num+8);
		int x=num[0]*1+num[1]*10+num[2]*100+num[3]*1000+num[4]*10000+num[5]*100000+num[6]*1000000+num[7]*10000000;
		int y=num[7]*1+num[6]*10+num[5]*100+num[4]*1000+num[3]*10000+num[2]*100000+num[1]*1000000+num[0]*10000000;
		printf("%d\n",x-y);
	}
	return 0;
}