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<cstdio>
#include<algorithm>

using namespace std;

int roop(int j)
{
	int ans=1;
	for(int i=0;i<j;i++)
	{
		ans*=10;
	}
	return ans;
}

int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
	int date[8];
	long long int max=0,min=0;
		char c[10];
		scanf("%s",c);
		for(int j=0;j<8;j++)
		{
			date[j]=c[j]-'0';
		}
		sort(date,date+8);
		for(int i=0;i<8;i++)
		{
			min+=date[i]*roop(7-i);
			max+=date[7-i]*roop(7-i);
		}
		printf("%ld\n",max-min);
	}
	return 0;
}