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
import java.io.*;
import java.util.Arrays;

class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String line="";
int maxValue;
int minValue;
int dif;
int[] num=new int[8];
int n=Integer.parseInt(br.readLine());
for(int p=0;p<n;p++){
line=br.readLine();
maxValue=0;
minValue=0;
dif=0;
for(int i=0;i<num.length;i++){
num[i]=(int)(line.charAt(i)-'0');
}
Arrays.sort(num);
for(int i=0;i<num.length;i++){
maxValue+=num[i]*Math.pow(10,i);
minValue+=num[i]*Math.pow(10,7-i);
}
dif=maxValue-minValue;
System.out.println(dif);
}
}
}