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.util.*;
public class Main {
		public static char [] ns = new char [8];
		public static char[] perm =new char[8];
		public static boolean[] used =new boolean[8];
		public static  int max,min;
		
	    public static void main(String[] args) throws java.io.IOException{
	        Scanner scan = new Scanner(System.in);
	        int n=scan.nextInt();
	        scan.nextLine();
	        for(int i=0;i<n;i++){
	        ns = scan.nextLine().toCharArray();
	        max=0;
	        min=99999999;
	        permutation(0,8);
	        System.out.println(max-min);
	        }
	        
	    }
	    public static void permutation(int pos,int n){
	    	if(pos==n){
	    		StringBuilder sb =new StringBuilder();
	    		for(int i=0;i<n;i++){
	    			sb.append(perm[i]);
	    		}
	    		max=Math.max(max,Integer.parseInt(sb.toString()));
	    		min=Math.min(min,Integer.parseInt(sb.toString()));
	    		return ;
	    		
	    	}
	    	
	    	for(int i=0;i<n;i++){
	    		if(!used[i]){
	    			perm[pos] = ns[i];
	    			used[i]=true;
	    			permutation(pos+1,n);
	    			used[i]=false;
	    		}
	    	}
	    	return ;
	    }
}
	    