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 <math.h>
int main(){
  int n;
  char c[8];
  std::cin>>n;
  for(;n,std::cin>>c;n--){
    std::sort(c,c+8);
    int max=0,min=0;
    for(int i=0;i<8;i++){
      int k = 7-i;
      max=max+static_cast<int>(c[k]-'0')*pow(10,k);
      min=min+static_cast<int>(c[k]-'0')*pow(10,i);
    }
    std::cout<<max-min<<std::endl;
  }
  return 0;
}