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>
using namespace std;
int main() {
	int n; cin >> n;
	for (int k = 0; k < n; k++){
		char l[10];
		cin >> l;
		int r[8];
		for (int i = 0; i < 8; i++){
			r[i] = l[i] - '0';
		}
		sort(r, r + 8);
		cout << r[7] * 9999999 + r[6] * 999990 + r[5] * 99900 + r[4] * 9000 - r[3] * 9000 - r[2] * 99900 - r[1] * 999990 - r[0] * 9999999;
		cout << endl;
	}
	return 0;
}