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 <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

int main(void){

	string s;

	int n;
	cin >> n;
	for( int i = 0; i < n; i++ ) {
		cin >> s;
		string maxstr, minstr;
		char ch[8];
		for( int j = 0; j < 8; j++ )
			ch[j] = s[j];
		sort( ch, ch + 8 );
		for( int j = 0; j < 8; j++ ) {
			maxstr += ch[7-j];
			minstr += ch[j];
		}
		int max, min;
		max = atoi(maxstr.c_str());
		min = atoi(minstr.c_str());
		cout << max - min << endl;
	}

    return 0;
}