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>
#include <string>
using namespace std;
int main() {
	int n; cin >> n;
	for (int ix=0;ix<n;ix++) {
		string num; cin >> num;
		sort(num.begin(),num.end());
		stringstream os;
		os.str(num);
		int min; os >> min;
		reverse(num.begin(),num.end());
		stringstream oss;
		oss.str(num);
		int max; oss >> max;
		cout << max-min << endl;
	}
}