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
//Volume0-0050
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		//initialization
        char[] c;
        int    small,
               large;
        StringBuffer sb = new StringBuffer();

        //input
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while(n-- > 0){
        	c = sc.next().toCharArray();

        	//calculation
        	sb.delete(0,8);
        	Arrays.sort(c);
        	small = Integer.parseInt(String.valueOf(c));
        	sb.append(c);
        	sb = sb.reverse();
        	large = Integer.parseInt(sb.toString());

        	//output
        	System.out.println(large - small);
        }
	}
}