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>
#include<cmath>
using namespace std;

int main(){

	int n;
	cin >> n;

	for(int j=0; j<n; j++){
		int d=0;
		int a[8];
		int n1=0,n2=0;
	
		cin >>d;

		for(int i=0; i<8; i++){
			a[i]=d%10;
			d/=10;
		}
		
		stable_sort(a,a+8);
	
		for(int i=0; i<8; i++){
			n1+=a[7-i]*pow(10,i);
			n2+=a[i]*pow(10,i);
		}

		cout << n2-n1 << endl;

	}
}