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<math.h>
#include <string.h>
#include <ctype.h>

int main(){
char b[8];
int a[8];
int n,i,j,k,max,min,f;

scanf("%d",&n);
for(i=0;i<n;i++){

for(j=0;j<8;j++){
scanf(" %c ",&b[j]);
a[j]=b[j]-'0';
}

for(j=0;j<7;j++){
for(k=j+1;k<8;k++){
if(a[j]<a[k]){
f=a[k];
a[k]=a[j];
a[j]=f;
}
}
}
max=10000000*a[0]+1000000*a[1]+100000*a[2]+10000*a[3]+1000*a[4]+100*a[5]+10*a[6]+a[7];
min=10000000*a[7]+1000000*a[6]+100000*a[5]+10000*a[4]+1000*a[3]+100*a[2]+10*a[1]+a[0];
f=max-min;
printf("%d\n",f);

}

return 0;
}