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>
#include <functional>
using namespace std;

int main(){
	long long int n,a[10],cast,b,c,input;
	while(cin >> n){
		for(int j=0;j<n;j++){
			b = 0;
			c = 0;
			cast = 10;
			cin >> input;
			for(int i=0;i<8;i++){
				a[i] = input % cast;
				input /= cast;
			}
			sort(a,a+8);
			cast = 1;
			for(int i=0;i<8;i++){
				b += a[i] * cast;
				cast *= 10;
			}
			sort(a,a+8,greater<int>());
			cast = 1;
			for(int i=0;i<8;i++){
				c += a[i] * cast;
				cast *= 10;
			}
			cout << b-c << endl;
		}
	}
	return 0;
}