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>

using namespace std;

int main(void){
    char data[9];
    int max,min;
    int src;
    int n,i,j,k;
    
    cin>>n;
    for(i=0;i<n;i++){
        cin>>data;
        sort(data,data+8);
        min=0;
        max=0;
        j=1;
        for(k=0;k<8;k++){
            min+=(int)(data[7-k]-'0')*j;
            max+=(int)(data[k]-'0')*j;
            j=j*10;
        }
        src=max-min;
        cout<<src<<endl;
    }
    return(0);
}