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 <string>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

int main()
{
	const int DATASETS = 1000;

	int n, MAX, MIN;

	string S[DATASETS], MAX1, MIN1;

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> S[i];
	}

	for (int i = 0; i < n; i++)
	{
		MAX1 = S[i]; sort(MAX1.begin(), MAX1.end(), greater<char>());
		MIN1 = S[i]; sort(MIN1.begin(), MIN1.end());

		MAX = stoi(const_cast<const string&>(MAX1));
		MIN = stoi(const_cast<const string&>(MIN1));

		cout << MAX - MIN << endl;
	}

	return 0;
}