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

int main() {
	int n,h,l,s,i,j;
	char da[10],a;
	cin >> n;
	for (n;n>0;n--) {
		scanf("%s",da);
		sort(da,da+8);
		h=l=0;
		for (i=0,s=10000000;i<8;i++,s/=10) {
			h+=(da[7-i]-'0')*s; l+=(da[i]-'0')*s;
		}
        cout << h-l << endl;
	}
	return 0;
}