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

import java.lang.*;

import java.math.*;



public class Main {

	Scanner sc = new Scanner(System.in);

	void run(){

		int n= sc.nextInt();

		for(int i=0; i<n;i++){

			char[] buf = String.valueOf(sc.nextInt()).toCharArray();

			Arrays.sort(buf);

			int a =Integer.valueOf(String.valueOf(buf));

			for(int j =0; j<buf.length/2;j++){

				char t = buf[j];

				buf[j] =buf[buf.length-j-1];

				buf[buf.length-j-1]=t;    

			}

			int b= Integer.valueOf(String.valueOf(buf));

			System.out.println(b-a);

		}

		

	}

	public static void main(String[] args){

		Main m = new Main();

		m.run();

		

	}

}