mod = 998244353

def check(x):
    x = str(x)
    l = len(x)
    if l == 1: return True
    for i in range(l-1):
        if x[i] > x[i+1]: return False
    return check(sum(map(int, x)))

def nxt(n):
    n = str(n)
    l = len(n)
    m = n[0]
    for i in range(1, l):
        if m[-1] <= n[i]:
            m += n[i]
        else:
            m += m[-1] * (l - i)
            break
    return int(m)

for i in range(int(input())):
    d = int(input()) + 1
    m = nxt(d)
    while check(m) == False:
        m = nxt(m + 1)
    
    m -= d
    ans = (pow(10, d, mod) - 1) * pow(9, -1, mod) % mod
    p, q = divmod(m, 8)
    ans += 8 * (pow(10, p, mod) - 1) * pow(9, -1, mod) % mod
    ans += q * pow(10, p, mod) % mod
    print(ans % mod)