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;

int main()
{
	int n,a,b;
	char str[16];
	
	cin >> n;
	while(n--)
	{
		cin >> str;
		vector<int> v;
		for(int i=0; str[i]; i++)
		{
			v.push_back(str[i]-'0');
		}
		
		a=b=0;
		sort(v.begin(), v.end());
		for(int i=0; i<v.size(); i++)
		{
			a*=10; a+=v[i];
		}
		reverse(v.begin(), v.end());
		for(int i=0; i<v.size(); i++)
		{
			b*=10; b+=v[i];
		}

		cout << b-a << endl;
	}
}