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 <algorithm>
#include <string>
#include <vector>
#include "math.h"
#include <iostream>

using namespace std;

int main()
{
	int digit[8], n, a, b;
	char c;
	
	cin >> n;
	for (int i=0; i<n; i++) {
		for (int i=0; i<8; i++) {
			cin >> c;
			digit[i] = c-'0';
		}
		sort(digit, digit+8);
		a=0; b=0;
		for (int i=0; i<8; i++) {
			b+=digit[i]*pow(10, i);
			a+=digit[7-i]*pow(10, i);
		}
		cout << b-a << endl;
	}
	return 0;
}