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():
    def plus1(s):
        n=len(s)
        num=str(int(s)+1).zfill(n)
        return num

    t=II()
    for _ in range(t):
        s=input()
        n=len(s)
        for r in range(n,0,-1):
            if s[r-1].isdigit():break
        else:
            print(s)
            continue
        for l in range(r,0,-1):
            if not s[l-1].isdigit():break
        print(s[:l]+plus1(s[l:r])+s[r:])

main()