M=int(input())
N=input()
p=998244353
l=len(N)
all_count = 1
for i in range(len(N)-1,-1,-1):
    n = int(N[i])
    count = (M-1-n)//10+1
    if i==0 and N[i] == '0':
        count -= 1
    all_count *= count
    all_count %= p
if all_count == 0:
    print(0)
    exit()
ans = 1
left = 1
for i in range(len(N)-1,-1,-1):
    n = int(N[i])
    count = (M-1-n)//10+1
    tmp=0
    tmp += (10*(count-1))*count//2
    tmp += n*count
    tmp%=p
    #print(tmp)
    #print(all_count*pow(count,-1,p)%p)
    ans+=tmp*left*all_count*pow(count,-1,p)
    ans %= p
    left *= M
    left %= p
print((ans-1)%p)