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

int main(){
	int n;
	scanf(" %d", &n);
	for(int i=0; i<n; ++i){
		long a;
		int p[8], q[8];
		scanf(" %ld", &a);
	
		for(int i=0; i<8; ++i){
			p[i] = ( a%(long)pow(10,8-i) ) / pow(10,7-i);
			q[i]=p[i];
			//printf("%d:%d\n", i, p[i]);
		}	
		
		sort(p, p+8);
		sort(q, q+8, greater<int>());
		
		long x=0, y=0;
		for(int i=0; i<8; ++i){
			x+=p[i]*pow(10,7-i);
			y+=q[i]*pow(10,7-i);
		}
	
		printf("%ld\n", y-x);
	}


	return 0;
}