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.Scanner;

public class Main {
	public static void main(String args[]) {
		solve51();
	}

	public static void solve51() {
		Scanner sc = new Scanner(System.in);
		{

			//最初の数字を読み込む
			int n = sc.nextInt();

			//n行分inputを読み込むまで繰り返す
			for (int i = 0; i < n; i++) {

				//数字が入るArrayを作る
				char[] arr = sc.next().toCharArray();

				//ソートして昇順に並べる
				Arrays.sort(arr);

				//昇順に並べた数字をIntに変換する
				int min = Integer.parseInt(new String(arr));
				//System.out.println(min);

				//降順に並べる
				int max = Integer.parseInt(new StringBuffer(new String(arr)).reverse()
						.toString());
				//System.out.println(max);

				//最大値から最小値を引く
				int result = max - min;
				System.out.println(result);

			}
		}

	}

}

