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<vector>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	vector<int>nums(10);
	cin>>n;
	while(n--)
	{
		int in;
		cin>>in;
		fill(nums.begin(),nums.end(),0);
		while(0<in)
		{
			int num=in%10;
			nums[num]++;
			in/=10;
		}
		int mx=0,mn=0;
		int i=9;
		vector<int> cp=nums;
		while(0<=i)
		{
			if(0<cp[i])
			{
				mx*=10;
				mx+=i;
				cp[i]--;
			}
			else i--;
		}
		i=0;
		while(i<10)
		{
			if(0<nums[i])
			{
				mn*=10;
				mn+=i;
				nums[i]--;
			}
			else i++;
		}

		cout<<mx-mn<<endl;
	}
  return 0;
}