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>
#include <functional>
using namespace std;

int main(void)
{
	int array[8];
	char str[9];
	int n;
	
	scanf("%d", &n);
	for (int i = 0; i < n; i++){
		long long a = 0, b = 0, sa;
		scanf("%s", str);
		for (int i = 0; i < 8; i++){
			array[i] = str[i] - '0';
		}
		sort(array, array + 8, greater<int>() );
		for (int i = 0; i < 8; i++){
			a *= 10;
			a += array[i];
		}
		sort(array, array + 8);
		for (int i = 0; i < 8; i++){
			b *= 10;
			b += array[i];
		}
		sa = a - b;
		printf("%lld\n", sa);
	}
	
	return (0);
}