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,i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
	int j,x[8];
	char y[10];
		scanf("%s",y);
		for(j=0;j<8;j++){
			x[j]=y[j]-'0';
		}
		sort(x,x+8);
		printf("%d\n",x[7]*9999999+x[6]*999990+x[5]*99900+x[4]*9000-x[3]*9000-x[2]*99900-x[1]*999990-x[0]*9999999);
	}
	return 0;
}