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

int shoujun(const void* a, const void* b){return *((char*)b)-*((char*)a);}
int koujun(const void* a, const void* b){return *((char*)a)-*((char*)b);}

int main()
{
	int line;
	cin >> line;
	for(int i=1;i<=line;i++)
	{
		char dataline[10];
		cin >> dataline;
		
		qsort(dataline,8,sizeof(char),shoujun);
		int largest = atoi(dataline);
		qsort(dataline,8,sizeof(char),koujun);
		int smallest = atoi(dataline);
		cout << largest - smallest << endl;
	}
	return 0;
}