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(void)
{
	int n;
	int max, min, box[8];
	int i, j;
	
	while (scanf("%d", &n) != EOF){
		for (i = 0; i < n; i++){
			scanf("%d", &max);
			for (j = 0; j < 8; j++){
				box[j] = max % 10;
				max /= 10;
			}
			
			sort(box, box + 8);
			
			max = min = 0;
			for (j = 0; j < 8; j++){
				min *= 10;
				max *= 10;
				min += box[j];
				max += box[7 - j];
			}
			
			printf("%d\n", max - min);
		}
	}
	return (0);
}