MOD = 998244353


def matmul(A, B):
    N = len(A)
    M = len(A[0])
    assert M == len(B)
    L = len(B[0])
    C = [[0 for _ in range(L)] for _ in range(N)]
    for i in range(N):
        for j in range(L):
            for k in range(M):
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD
    return C


def main():
    N = list(map(int, input()))
    K = int(input())
    M = [[int(i == j) for j in range(23)] for i in range(23)]
    for i in range(23):
        A = M[i]
        for n in N:
            y = (A[21] + (A[22] if n else 0)) % MOD
            x = (A[20] * 10 + y * n) % MOD
            A[20] = (A[20] + x - A[n * 2]) % MOD
            A[21] = (A[21] + y - A[n * 2 + 1]) % MOD
            A[n * 2] = x
            A[n * 2 + 1] = y

    P = [[int(i == j) for j in range(23)] for i in range(23)]
    while K:
        if K & 1:
            P = matmul(P, M)
        M = matmul(M, M)
        K >>= 1
    print(P[22][20])


if __name__ == "__main__":
    main()