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<string>
#include<math.h>
using namespace std;
int main(){
    char a[8];
	long long h,l,n;
	cin>>n;
	for(int k=0;k<n;k++){
		for(int j=0;j<8;j++)
			cin>>a[j];
		for(int i=0;i<7;i++){
            for(int j=7;j>i;j--){
	            if(a[j]<a[j-1]){
	            int tmp=a[j];
	            a[j]=a[j-1];
	            a[j-1]=tmp;
	            }
            }
        }
		h=0,l=0;
		for(int j=0;j<8;j++){
			double t=j;
			l+=a[j]*pow(10,7-t);
			h+=a[7-j]*pow(10,7-t);
		}
		cout<<h-l<<endl;
	}
	return 0;
}