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 <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
  int n; cin >> n;
  while (n--) {
    vector<int> v;
    long l; cin >> l;
    while (l != 0) { v.push_back(l % 10); l /= 10; }
    sort(v.begin(), v.end());
    long a = 0, b = 0;
    for (auto it = v.begin(); it != v.end(); it++) a = a * 10 + *it;
    for (auto it = v.rbegin(); it != v.rend(); it++) b = b * 10 + *it;
    cout << b - a << endl;
  }
}