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
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int n1;
	cin>>n1;
	for(int l=0;l<n1;++l){
		int a[8],max=0,min=0,n;
		cin>>n;
		for(int i=0;i<8;++i){
			a[i]=n%10;
			n/=10;
		}
		sort(a,a+8);
		for(int i=7;i>=0;--i){
			max*=10;
			max+=a[i];
		}
		for(int i=0;i<8;++i){
			min*=10;
			min+=a[i];
		}
		cout<<max-min<<endl;
	}
}