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
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <functional>
#include <cstdio>
using namespace std;

int solve(int in){
	char mozi[9] = {};
	int max, min;
	// itoa(in, mozi, 10);
	sprintf(mozi, "%d", in);

	sort(mozi, mozi + 8);
	min = atoi(mozi);

	sort(mozi, mozi + 8, greater<int>());
	max = atoi(mozi);
	
	return abs(max - min);
}


int main(){
	int n,in;

	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> in;
		cout << solve(in) << endl;
	}

	return 0;
}