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>
using namespace std;
int main(){
    int n;
    scanf("%d",&n);
    for(int q = 0;q < n; q++){
        int a=0,b=0,ans=0;
        char str[10]={0};
        scanf("%s",str);
        sort(str,str+8);
        for(int i = 7;i >= 0; i--){
            int x = pow(10.0,(double)i);
            a += (str[7-i]-48)*x;
            b += (str[i]-48) * x;
        }
        ans = b - a;
        printf("%d\n",ans);
    }
    return 0;
}