from itertools import *
from bisect import *
mod = 998244353

def c(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 c(sum(map(int, x)))

ok = []
for p in combinations_with_replacement(range(16), 9):
    p += (16,)
    x, t = 0, 0
    for i in range(16):
        x = x * 10 + t
        while p[t] == i: t += 1
    if c(x): ok.append(x)
ok.sort()

inv9 = pow(9, -1, mod)
for i in range(int(input())):
    n = int(input()) + 1
    s = ok[bisect_left(ok, n)]
    p, q = divmod(s - n, 8)
    ans = (pow(10, n, mod) - 1) * inv9 % mod
    ans += (pow(10, p, mod) - 1) * 8 * inv9 % mod
    ans += pow(10, p, mod) * q % mod
    print(ans % mod)