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<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;

int int_pow(int n, int m){
	int ans = 1;
	while (m--){
		ans *= n;
	}
	return ans;
}

int main(){
	int n;
	cin >> n;
	for (int i = 0; i < n; i++){
		int max = 0, mini = 0;
		char input[8];
		for (int j = 0; j < 8; j++){
			cin >> input[j];
			input[j] -= '0';
		}
		sort(input, input + 8);
		for (int j = 0; j < 8; j++){
			mini += input[j] * int_pow(10, 7 - j);
			max += input[j] * int_pow(10, j);
		}
		printf("%d\n", max - mini);
	}
}