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

public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = Integer.parseInt(sc.nextLine());
			for (int i = 0; i < n; i++) {
				String strNum = sc.nextLine();
				System.out.println( min_max_diff(strNum) );
			}

	}

	private static int min_max_diff(String strNum) {
		Integer[] nums = new Integer[strNum.length()];

			for (int i = 0; i < strNum.length(); i++) {
				nums[i] = Integer.parseInt(String.valueOf(strNum.charAt(i)));
			}

		Arrays.sort(nums, Comparator.naturalOrder());
		int biggest = toInt(nums);

		Arrays.sort(nums, Comparator.reverseOrder());
		int smallest = toInt(nums);

		return biggest - smallest;
	}

	private static int toInt(Integer[] nums) {
		int sum = 0;

		for (int i = nums.length - 1; i >= 0; i--) {
			sum += (int)Math.pow(10, i) * nums[i];
		}


		return sum;
	}

}
