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

int main()
{
	int n;
	int ret[8];
	cin>>n;
	while(n-- > 0){
		string s;
		cin>>s;
		for(int i=0;i<8;i++) ret[i] = s[i] - '0';
		int Min=0, Max=0;
		sort(ret, ret+8);
		for(int i=0;i<8;i++){
			Max += pow(10, i)*ret[i];
		}
		
		for(int i=7;i>=0;i--){
			Min +=  pow(10,i)*ret[7-i];
		}
		int differential = Max - Min;
		
		cout<<differential<<endl;
	}
	return 0;
}