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>

int main(void)
{
	int n;
	int i, j, k;
	int max;
	int min;
	char num[16];
	char t;
	
	scanf("%d", &n);
	
	for (i = 0; i < n; i++){
		scanf("%s", num);
		
		for (j = 0; j < 7; j++){
			for (k = 0; k < 7 - j; k++){
				if (num[k] > num[k + 1]){
					t = num[k + 1];
					num[k + 1] = num[k];
					num[k] = t;
				}
			}
		}
		max = 0; min = 0;
		for (j = 0; j < 8; j++){
			min *= 10;
			min += num[j] - '0';
		}
		for (j = 7; j >= 0; j--){
			max *= 10;
			max += num[j] - '0';
		}
		
		printf("%d\n", max - min);
	}
	
	return (0);
}