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>

#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;

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

	rep(i, n) {
		long seq, max = 0, min = 0;
		cin >> seq;
		int num[8];

		rep(j, 8) {
			num[j] = seq % 10;
			seq = (seq - num[j]) / 10;
		}

		rep(j, 8) {
			rep(k, 8 - j) {
				if (num[j + k] > num[j]) {
					swap(num[j], num[j + k]);
				}
			}
		}

		rep(j, 8) {
			max *= 10;
			max += num[j];
			min *= 10;
			min += num[7 - j];
		}

		cout << max - min << endl;
	}
	return 0;
}