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 <vector>
#include <algorithm>

using namespace std;

void solve()
{
	int n;
	cin >> n;
	while(n--)
	{
		int num;
		cin >> num;
		vector<int> Vec;
		while(num)
		{
			Vec.push_back(num % 10);
			num /= 10;
		}
		sort(Vec.begin(), Vec.end());
		int max = 0, min = 0;
		for(int i = Vec.size() - 1; i >= 0; --i)
		{
			max *= 10;
			max += Vec[i];
		}
		for(int i = 0; i < Vec.size(); ++i)
		{
			min *= 10;
			min += Vec[i];
		}
		cout << max - min << endl;
	}
}

int main()
{
	solve();
	return(0);
}