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 <stdio.h>
#include <algorithm>
using namespace std;

int main(){
	int i,j,n,num[8],Min = 0,Max = 0,ten;
	scanf("%d",&n);
	for(i = 0;i < n;i++){
		Min = 0;
		Max = 0;
		ten = 1;
		scanf("%d",&num[0]);
		for(j = 7;j >= 0;j--){
			num[j] = num[0] / ten % 10;
			ten *= 10;
		}
		ten = 1;
		sort(num,num + 8);
		for(j = 7;j >= 0;j--) {
			Min += num[j] * ten;
			ten *= 10;
		}
		ten = 1;
		reverse(num,num + 8);
		for(j = 7;j >= 0;j--) {
			Max += num[j] * ten;
			ten *= 10;
		}
		printf("%d\n",Max - Min);
	}
	return 0;
}