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
// 2015/12/14 Tazoe

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin >> n;

	for(int i=0; i<n; i++){
		string s;
		cin >> s;

		int m[8];
		for(int j=0; j<8; j++){
			m[j] = (int)(s[j]-'0');
		}

		sort(m, m+8);

		int m_max = 0;
		int m_min = 0;

		for(int j=0; j<8; j++){
			m_max *= 10;
			m_max += m[7-j];
			m_min *= 10;
			m_min += m[j];
		}

		cout << m_max-m_min << endl;
	}

	return 0;
}