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{
    static Scanner kbd = new Scanner(System.in);
    public static void main(String[] args){
	int a = kbd.nextInt();
	while(a>0){
	    String n = kbd.next();
	    int[] num = new int[8];
	    int i;
	    for(i=0; i<num.length; i++){
		num[i] = Integer.parseInt(n.substring(i, i+1));
	    }
	    sortMin(num);
	    String max = "";
	    String min = "";
	    for(i=0; i<num.length; i++){
		max += Integer.toString(num[num.length-1-i]);
		min += Integer.toString(num[i]);
	    }

	    int ans = Integer.parseInt(max) - Integer.parseInt(min);
	    System.out.println(ans);
	    a--;
	}
    }

    static void sortMin(int[] num){
	int i, j;
	for(i=0; i<num.length; i++){
	    for(j=i+1; j<num.length; j++){
		if(num[i] > num[j]){
		    int w = num[i];
		    num[i] = num[j];
		    num[j] = w;
		}
	    }
	}
    }
}
	    