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 <bits/stdc++.h>
using namespace std;
 
int main(){
    char a[10];
    int n;
    cin >> n;
    for(int j=0;j<n;j++){
        scanf("%s",a);
        int b[8];
        for(int i=0;i<8;i++){
            b[i]=a[i]-'0';
        }
        sort(b,b+8);
        int max=0,min=0;
        for(int i=0;i<8;i++){
            max=max*10+b[7-i];
            min=min*10+b[i];
        }
        cout << max-min << endl;
    }
}
