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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int time = sc.nextInt();
		int num[] = new int[8];
		String temp;
		for(int i = 0; i < time; i++){
			temp = sc.next();
			for(int k = 0; k< 8; k++){
				num[k] = Integer.valueOf(temp.substring(k,k+1));
			}
			Arrays.sort(num);
			int c = 1;
			int min = 0;
			int max = 0;
			for(int x = 0; x < 8;x++){
				max = max + num[x] * c;	
				min = min + num[7-x] * c;
				c = c * 10;
			}
			//System.out.println("max is " + max);
			//System.out.println("min is " + min);
			System.out.println(max - min);
			
		}
	}
}