import sys
input = sys.stdin.readline

S0=list(map(int,list(input().strip())))
n=int(input())

mod=998244353

LEN=len(S0)

def calc(C,S,one):
    TC=sum(C)%mod
    TS=sum(S)%mod
    
    for i in range(LEN):
        s=S0[i]
        plus=-C[s]

        if s==0:
            C[s]=TC
        else:
            C[s]=(TC+one)%mod

        TC=(TC+plus+C[s])%mod

        plus=-S[s]

        S[s]=(10*TS+s*C[s])%mod
        TS=(TS+plus+S[s])%mod

    return C,S,one

X=[]

for i in range(10):
    C=[0]*10
    S=[0]*10
    C[i]=1
    C2,S2,one=calc(C,S,0)

    A=C2+S2+[one]

    X.append(A)

for i in range(10):
    C=[0]*10
    S=[0]*10
    S[i]=1
    C2,S2,one=calc(C,S,0)

    A=C2+S2+[one]

    X.append(A)

C=[0]*10
S=[0]*10
C2,S2,one=calc(C,S,1)

A=C2+S2+[one]

X.append(A)

#for x in X:
#    print(x)


#Y=[[0]*21 for i in range(21)]

#for i in range(21):
#    for j in range(21):
#        Y[i][j]=X[j][i]

#X=Y

# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

POWA=[X]
for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],21,21,21)) # ベキを求めて


X=[0]*21
X[-1]=1
X=[X]
while n:
    X=prod(X,POWA[n.bit_length()-1],1,21,21) # n乗の場合
    n-=1<<(n.bit_length()-1)


#print(X)
print(sum(X[0][10:-1])%mod)