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<string>
#include<functional>
#include<algorithm>
using namespace std;

int main(){
  string num;
  int tmp1[11111],tmp2[11111];
  int n;
  cin >> n;
  for(int i=0;i<n;i++){
    cin >> num;
    int x=0,y=0;
    for(int j=0;j<8;j++){
      tmp1[j] = num[j] - '0';
      tmp2[j] = num[j] - '0';
    }
    sort(tmp1,tmp1+8);
    sort(tmp2,tmp2+8,greater<int>());
    for(int j=0;j<8;j++){
      x *= 10;
      y *= 10;
      x += tmp1[j];
      y += tmp2[j];
    }
    cout << y-x << endl;
  }
}