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 d;
	cin >> d;
	for(int k=0;k<d;k++){
		char num[8];
		int num2[8];
		for(int i=0;i<8;i++){
			cin >> num[i];
			num2[i] = (int)num[i];
		}
		
		sort(num2,num2+8);
		int max=0,min=0;
		int a=1;
		int b=10000000;
		for(int i=0;i<8;i++){
			max += num2[i]*a;
			min += num2[i]*b;
			a*=10;
			b/=10;
		}
		cout << max-min << endl;
	}
	return 0;

}