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.*;
import java.io.*;

class Main {

    public static void main(String[] args) {

	final Scanner stdin = new Scanner(System.in);
	final int T = stdin.nextInt();

	for ( int i = 0; i < T; i++ ) {

	    int n = stdin.nextInt();
	    int[] up = new int[8];
	    for ( int j = 0; j < 8; j++ ) {
		up[j] = n % 10;
		n /= 10;
	    }
	    Arrays.sort( up );
	    
	    int max = 0;
	    for ( int j = 7; j >= 0; j-- ) {
		max = max * 10 + up[j];
	    }

	    int min = 0;
	    for ( int j = 0; j < 8; j++ ) {
		min = min * 10 + up[j];
	    }

	    System.out.println( max - min );	    
	}
	
    }
    
}