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.Arrays;
import java.util.Scanner;
public class Main{
	private static Scanner sc=new Scanner(System.in);
	
	void ans(){
		int n=sc.nextInt();
		int a[]=new int[8];
		for(int i=0;i<n;i++){
			String  pp=sc.next();
			char ps[]=pp.toCharArray();
			
			for(int j=0;j<8;j++){
				a[j]=ps[j];
			}
			
			
			
			Arrays.sort(a);
			int count=1;
			int temp=0;
			int ans=0;
			for(int j=0;j<8;j++){
				 temp+=a[j]*count;
				count*=10;
				//System.err.println(temp);
			}
			
			
			
			count=1;
			for(int j=7;j>=0;j--){
				ans+=a[j]*count;
				count*=10;
				//System.err.println(ans);
			}
			
			
			
			temp-=ans;
			System.out.println(temp);
		}
	    
	}
	public static void main(String[] args) {
	
		Main app=new Main();
		app.ans();
	}

}