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<cstdio>
#include<string>
using namespace std;

int solve(string str){
    char x[9], y[9];
    x[8] = y[8] = 0;
    string rev;
    for(int i = 0;i < 8;i++)x[i] = str[i];
    sort(x, x + 8);
    for(int i = 0;i < 8;i++)y[i] = x[7 - i];
    int a, b;
    sscanf(x, "%d", &a);
    sscanf(y, "%d", &b);
    return abs(a- b);
}

int main(){
    int n;
    string str;
    cin >> n;
    for(int i = 0;i < n;i++){
	cin >> str;
	cout << solve(str) << endl;
    }
    return 0;
}