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 <string>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iterator>
#include <sstream>

using namespace std;

int main()
{
	int t; cin>>t;
	while(t--){
		string s; cin>>s;
		sort(s.begin(),s.end(),greater<char>());
		int m,n;
		sscanf(s.c_str(),"%d",&m);
		sort(s.begin(),s.end(),less<char>());
		sscanf(s.c_str(),"%d",&n);
		cout << abs(m-n) << endl;
	}

	return 0;
}