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

int main() {

  int n;
  cin >> n;

  for ( int i = 0; i < n; i++ ) {

    int cnt[10] = {0};

    char c;
    for ( int j = 0; j < 8; j++ ) {
      cin >> c;
      cnt[c-'0']++;
    }

    int x = 0;
    int y = 0;
    int z = 1;

    for ( int j = 0; j < 10; j++ ) {

      if ( cnt[j] != 0 ) {

	cnt[j]--;
	x += j*z;
	y += j*(10000000/z);
	j--;
	z*=10;
	continue;

      }

    }

    cout << x - y << endl;

  }

  return 0;

}