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.io.*;
import java.util.ArrayDeque;
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 stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		for(int i = 0; i < n; i++) {
			char[] A = stdIn.next().toCharArray();
			Integer[] AA = p(A);
			char[] B = Arrays.copyOf(A, A.length);
			Integer[] BB = p(B);
			Arrays.sort(AA);
			Arrays.sort(BB, Collections.reverseOrder());
			int a = pa(AA);
			int b = pa(BB);
			System.out.println(b - a);
		}
	}
	public static Integer[] p(char[] a) {
		Integer[] ret = new Integer[a.length];
		for(int i = 0; i < a.length; i++) {
			ret[i] = Integer.parseInt(String.valueOf(a[i]));
		}
		return ret;
	}
	public static int pa(Integer[] a) {
		int ret = 0;
		for(int i = 0; i < a.length; i++) {
			ret += a[i] * pb(8 - i);
		}
		return ret;
	}
	public static int pb(int a) {
		int ax = 1;
		for(int i = 1; i < a; i++) {
			ax *= 10;
		}
		return ax;
	}
}