from bisect import bisect_left
from itertools import combinations

LIMIT = 15


def enum():
    for comb in combinations(range(LIMIT + 9), r=9):
        comb = list(comb)
        val = 0

        for i, c in enumerate(comb):
            val += (10 ** (c - i) - 1) // 9

        yield val


cand = set()

for v in sorted(enum()):
    digit_sum = sum(int(x) for x in str(v))
    if digit_sum <= 9 or digit_sum in cand:
        cand.add(v)

cand = sorted(cand)
MOD = 998244353


def solve():
    N = int(input())
    min_digit_sum = cand[bisect_left(cand, N + 1)]

    ans = (pow(10, N + 1, MOD) - 1) * pow(9, -1, MOD) % MOD
    remain = min_digit_sum - (N + 1)

    d, r = remain // 8, remain % 8
    ans += (pow(10, d + 1, MOD) - 1) * pow(9, -1, MOD) * r % MOD
    ans += (pow(10, d, MOD) - 1) * pow(9, -1, MOD) * (8 - r) % MOD
    ans %= MOD

    print(ans)


if __name__ == "__main__":
    T = int(input())
    for _ in range(T):
        solve()