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 <iostream>
#include <algorithm>
#include <functional>
#include <stdlib.h>

using namespace std;

int main(int argc, char **argv)
{
	int n, tmp, tmp2;
	char *c;
	
	cin >> n;
	for(int i = 0; i < n; i++){
		c = (char *)calloc(8, sizeof(char));
		cin >> c[0] >> c[1] >> c[2] >> c[3] >> c[4] >> c[5] >> c[6] >> c[7];

		sort(c, c+8);
		tmp = atoi(c);
		sort(c, c+8, greater<char>());		
		tmp2 = atoi(c);
		
		cout << (tmp2-tmp) << endl;
		
		free(c);
	}
	
	return 0;
}