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.*;
public class Main {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int n=cin.nextInt();
		for(int r=0;r<n;r++){
			int x=cin.nextInt();
			System.out.println(max(x)-min(x));
		}
	}
	static int max(int x){
		int ans=0;
		int[] a=new int[10];
		for(int q=0;q<9;q++){
			a[q]=0;
		}
		for(int i=0;i<8;i++){
			a[x%10]=a[x%10]+1;
			x=x/10;
		}
		for(int w=9;w>=0;w--){
			for(int p=0;p<a[w];p++){
			ans=ans*10;
			ans+=w;
			}
		}
		return ans;
	}
	static int min(int x){
		int ans=0;
		int[] a=new int[10];
		for(int q=0;q<9;q++){
			a[q]=0;
		}
		for(int i=0;i<8;i++){
			a[x%10]=a[x%10]+1;
			x=x/10;
		}
		for(int w=0;w<=9;w++){
			for(int p=0;p<a[w];p++){
			ans=ans*10;
			ans+=w;
			}
		}
		return ans;
	}
}