#nullable enable

#region
var _input = Array.Empty<string>();
var _iter = 0;
string String()
{
    while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Split(' '), 0);
    return _input[_iter++];
}
T I<T>() where T : IParsable<T> => T.Parse(String(), null);
#endregion

const int Mod = 998244353;
static long Power(long v, long p)
{
    var (res, k) = (1L, v);
    while (p > 0)
    {
        if ((p & 1) > 0) res = res * k % Mod;
        k = k * k % Mod;
        p >>= 1;
    }
    return res;
}

static long NextMonotone(long n)
{
    var s = n.ToString().Select(e => e - '0').ToArray();
    for (var i = 1; i < s.Length; i++)
    {
        if (s[i - 1] > s[i])
        {
            for (var j = i; j < s.Length; j++) s[j] = s[i - 1];
            break;
        }
    }
    var res = 0L;
    for (var i = 0; i < s.Length; i++) res = res * 10 + s[i];
    return res;
}

static (long, bool) Op(long n)
{
    var res = 0L;
    var last = 10L;
    var monotone = true;
    while (n > 0)
    {
        var (div, rem) = long.DivRem(n, 10);
        res += rem;
        n = div;
        monotone &= rem <= last;
        last = rem;
    }
    return (res, monotone);
}

static bool J(long n)
{
    if (n < 10) return true;
    var (next, monotone) = Op(n);
    if (!monotone) return false;
    return J(next);
}

long Solve(long n)
{
    if (n == 0) return 1;
    var m = n + 1;
    while (true)
    {
        if (J(m)) break;
        m = NextMonotone(m + 1);
    }
    var d = m - n - 1;
    var p = d / 8;
    var q = d % 8;
    var elz = Power(10, n + 1 - p - 1) + Mod - 1;
    elz = elz * Power(9, Mod - 2) % Mod;
    elz = elz * Power(10, p + 1) % Mod;
    var p10 = Power(10, p);
    var tns = (p10 + Mod - 1 + p10 * (q + 1)) % Mod;
    tns = (tns + elz) % Mod;
    return tns;
}

var t = I<int>();
var ans = new long[t];
for (var i = 0; i < t; i++) ans[i] = Solve(I<long>());
Console.WriteLine(string.Join(Environment.NewLine, ans));