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 num[8];
	int n, number;
	int min = 0, max = 0;
	
	cin >> n;
	for(int c = 0; c < n; c++){
		min = max = 0;
		cin >> number;
		for(int i = 7; i >= 0; i--){
			num[i] = number % 10;
			number /= 10;
		}
	
		sort(num, num+8);
		for(int i = 0, j = 10000000; i < 8; i++){
			min += num[i] * j;
			j /= 10;
		}
		for(int i = 7, j = 10000000; i >= 0; i--){
			max += num[i] * j;
			j /= 10;
		}
	
		cout << max - min << endl;
	}
	return 0;
}