from bisect import bisect_left, bisect_right

def is_monotonic(n):
    while 10 <= n and sum(int(str(n)[i]) <= int(str(n)[i+1]) for i in range(len(str(n))-1)) == len(str(n))-1:
        n = sum(int(a) for a in str(n))
    return n < 10

def func(n, pre, m):
    if n and is_monotonic(m):
        monotonic.append(m)
    if n == 15:
        return
    for i in range(pre, 10):
        func(n+1, i, m*10+i)

MOD = 998244353

monotonic = []
func(0, 1, 0)
monotonic.sort()

POW1 = [1, 11]
POW0 = [1, 10]
for _ in range(60):
    POW0.append(POW0[-1]**2%MOD)
    POW1.append((POW1[-1]*POW0[-1]%MOD+POW1[-1])%MOD)

for _ in range(int(input())):
    N = int(input())

    diff = monotonic[bisect_left(monotonic, N+1)]-(N+1)

    ans = 0
    for i in range(60):
        if 1<<i & (N+1):
            ans *= POW0[i+1]
            ans %= MOD
            ans += POW1[i]
            ans %= MOD
    
    d, m = divmod(diff, 8)
    SUM = 0
    for i in range(60):
        if 1<<i & d:
            SUM *= POW0[i+1]
            SUM %= MOD
            SUM += POW1[i]
            SUM %= MOD
    ans += SUM*8
    ans %= MOD
    SUM = 1
    for i in range(60):
        if 1<<i & d:
            SUM *= POW0[i+1]
            SUM %= MOD
    ans += SUM*m
    ans %= MOD

    print(ans)