MOD = 998244353
inv_2 = pow(2, -1, MOD)


def is_good(n):
    digits = [int(d) for d in str(n)]
    return any(digits[i] > digits[i + 1] + digits[i + 2] for i in range(len(digits) - 2))


dist = [0] * 10000
max_good = 10000

for i in range(9999, -1, -1):
    if is_good(i):
        max_good = i
    dist[i] = max_good - i


def count_bad_numbers(X):
    digits = [int(x) for x in str(X)]

    dp = [[0] * 100 for _ in range(2)]
    dp[1][0] = 1

    for x in digits:
        ndp = [[0] * 100 for _ in range(2)]

        for tight in range(2):
            lim = x if tight else 9

            for prev in range(100):
                cur = dp[tight][prev]
                if cur == 0:
                    continue

                a = prev // 10
                b = prev % 10

                for v in range(lim + 1):
                    if a > b + v:
                        continue

                    ntight = tight and (v == lim)
                    to = (10 * prev + v) % 100
                    ndp[ntight][to] += cur
                    ndp[ntight][to] %= MOD

        dp = ndp

    return [(dp[0][val] + dp[1][val]) % MOD for val in range(100)]


def solve():
    N = int(input())

    div = N // 100
    count = count_bad_numbers(div)

    ans = 0

    for suf in range(100):
        for pref in range(100):
            val = 100 * pref + suf
            ans += count[pref] * dist[val]
            ans %= MOD

    ans -= dist[0]
    ans += (N % MOD) * ((N + 1) % MOD) % MOD * inv_2 % MOD

    max_good = 100 * (div + 1)
    for i in range(100 * (div + 1) - 1, N, -1):
        if is_good(i):
            max_good = i
        ans -= max_good - i

    ans %= MOD

    print(ans)


if __name__ == "__main__":
    T = int(input())

    for _ in range(T):
        solve()