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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(
				System.in));
		StringBuilder builder = new StringBuilder();
		int n = Integer.parseInt(reader.readLine());
		while (n-- > 0) {
			String lines = reader.readLine();
			int[] nums = new int[lines.length()];
			char[] chs = new char[lines.length()];
			for (int i = 0; i < lines.length(); i++) {
				chs[i] = lines.charAt(i);
			}
			Arrays.sort(chs);
			char[] chs2 = new char[chs.length];
			int count = 0;
			for (int i = chs.length-1; i >= 0; i--) {
				chs2[count] = chs[i];
				count++;
			}
			int a = Integer.parseInt(String.valueOf(chs2));
			int b = Integer.parseInt(String.valueOf(chs));
			System.out.println(a - b);

		}

	}
}