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<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include <vector>
#include <map>

using namespace std;

void Solution()
{
     int n;
    
    string a;
    int b;
    int c;
    
    cin>>n;
    
    while (n--)
    { 
        cin>>a;
        
        sort(a.begin(), a.end());
        b = atoi(a.c_str()); //string to int
        
        reverse(a.begin(), a.end());
        c = atoi(a.c_str());
        
        cout<<c - b<<endl;
    }
    
}

int main()
{
    Solution();
    return 0;
}