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<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<sstream>
#define INF 999999
using namespace std;
int main(){
    int N;
    cin>>N;
    while(N--){
        stringstream ss;
        int NUM1,NUM2;
        char C[15];
        cin>>NUM1;
        ss<<NUM1;ss>>C;
        sort(C,C+strlen(C));
        NUM1=atoi(&C[0]);
        reverse(C,C+strlen(C));
        NUM2=atoi(&C[0]);
        cout<<max(NUM1,NUM2)-min(NUM1,NUM2)<<endl;
    }
    return 0;
}