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
# -*- coding: utf-8 -*-

n = int(raw_input())
for i in range(n):
    line = str(raw_input())
    p = []
    for j in range(len(line)):
        p.append(int(line[j]))
    p.sort()
    x = 1
    max = 0
    min = 0
    for j in range(len(p)):
        max += p[j]*x
        min += p[len(p)-j-1]*x
        x *= 10
    print max-min