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

class Main {
	public static void main(String args[]) {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		try {
			int n = Integer.parseInt(br.readLine());
			for (int i=0;i<n;i++) {
				String v = br.readLine();
				int a[] = new int[8];
				int max[] = new int[8];
				int min[] = new int[8];
				for (int j=0;j<8;j++) {
					a[j] = Character.getNumericValue(v.charAt(j));
				}
				Arrays.sort(a);
				for (int j=0;j<8;j++) {
					min[j] = a[j];
					max[j] = a[7-j];
				}
				int dif[] = new int[8];
				sub(max,min,dif);

				int c = 0;
				while (dif[c]==0) {
					c++;
					if (c==7) break;
				}
				for (int j=c;j<8;j++) {
					System.out.print(dif[j]);
				}
				System.out.println("");
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void sub(int a[],int b[],int c[]) {
		for (int i=7;i>=0;i--) {
			c[i] = a[i]-b[i];
			if (c[i]<0) {
				a[i-1] -= 1;
				c[i] += 10;
			}
		}
	}
}