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 <sstream>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin >> n;
	for(int i=0;i<n;i++){
		stringstream sst;
		string str;
		int m;
		cin >> str;
		sst << str;
		sst >> m;
		int num[8];
		for(int j=0;j<8;j++){
			num[j] = m%10;
			m/=10;
		}
		sort(num,num+8);
		int max=0,min=0;
		for(int j=0;j<8;j++){
			min += num[j];
			min *=10;
			max +=num[7-j];
			max *=10;
		}
		max/=10;
		min/=10;
		cout << max-min << endl;
	}
	return 0;
}