from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    # "0"48,"9"57
    t = II()
    for _ in range(t):
        s = list(input())
        n = len(s)
        for i in range(n - 1, -1, -1):
            code = ord(s[i])
            if 48 <= code <= 57:
                if code == 57:
                    for j in range(i, -1, -1):
                        code = ord(s[j])
                        if code == 57:
                            s[j] = "0"
                        elif 48 <= code <= 56:
                            s[j] = chr(code + 1)
                            break
                        else:
                            s[j] += "1"
                            break
                    else:
                        s[0] = "10"
                    break
                else:
                    s[i] = chr(code + 1)
                break
        print("".join(s))

main()