def solve(s):
    idx = len(s)
    flag = False
    last = 0
    for c in s[::-1]:
        idx -= 1
        if '0' <= c and c <= '9':
            if not flag:
                flag = True
                last = idx + 1
        elif flag:
            first = idx + 1
            incremented = s[:first] + increment(s[first:last]) + s[last:]
            return incremented
    if flag:
        first = 0
        incremented = s[:first] + increment(s[first:last]) + s[last:]
        return incremented
    return s

def increment(s):
    ints = int(s)
    n = len(s)
    numn = len(str(ints))
    incremented = str(ints + 1)
    if numn == len(incremented):
        return '0' * (n - numn) + incremented
    if s[0] == '0':
        return '0' * (n - numn - 1) + incremented
    return incremented

    

n = int(input())
for i in range(n):
    s = input()
    print(solve(s))