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 <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;

int N,n[8];
string s;

int main(){
	cin>>N;
	while(cin>>s){
		for(int i=0;i<8;i++)n[i]=s[i]-'0';
		sort(n,n+8);
		int M=0,m=0;
		for(int i=0;i<8;i++){
			M+=n[i]*pow(10,i);
			m+=n[7-i]*pow(10,i);
		}
		cout<<M-m<<endl;
	}
}