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 <string>
#include <functional>
#include <math.h>
using namespace std;

int main()
{
	int n;
	string str;

	cin >> n;

	while (n--)
	{
		cin >> str;

		int Min = 0, Max = 0;

		sort(str.begin(), str.end());
		for (int i = 0; i < 8; i++) Max += pow(10, i) * (str[i] - '0');

		sort(str.begin(), str.end(), greater<int>());
		for (int i = 0; i < 8; i++) Min += pow(10, i) * (str[i] - '0');

		cout << Max - Min << endl;
	}

	return 0;
}