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
def join_num(arr):
    result = 0
    for i in range(len(arr)):
        result += arr[i] * 10**(7-i)
    return result
    
n = int(input())
x = [0] * n
for i in range(n):
    x[i] = str(input())

for i in range(n):
    d = []
    for c in x[i]:
        d.append(int(c))
    d.sort()
    a = join_num(d)
    d.reverse()
    b = join_num(d)
    print(b-a)