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<math.h>
#include<algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
int main()
{
	int N;
	cin >> N;
	while(N--){
		int num[8];
		int numchar;
		int max=0;
		int min=0;
		cin >> numchar;
		REP(i,8){
			num[i] = numchar%10;
			numchar /= 10;
		}
		sort(num , num+8);
		REP(i,8){
			max += num[i]*pow(10,(double)i);
		}
		REP(i,8){
			min += num[7-i] * pow(10,(double)i);
		}
		cout << max - min << endl;
	}
	return 0;
}