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>
using namespace std;

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