M = int(input())
N = input()
L = len(N)
mod = 998244353

B = [0] * L
A = [0] * L
for i in range(L):
    r = int(N[i])
    if r > M-1:
        B[i], A[i] = 0, 0
        continue
    K = (M-1-r)//10%mod
    if i == 0 and r == 0:
        if K < 1:
            B[i], A[i] = 0, 0
            continue
        B[i] = K
        A[i] = 10 * K * (K+1)//2%mod
    else:
        B[i] = K+1
        A[i] = ((K+1)*r+10*(K*(K+1)//2))%mod

for b in B:
    if b == 0:
        print(0)
        exit()

P = 1
for b in B:
    P = (P * b) % mod

p = [1] * L
for j in range(1, L):
    p[j] = (p[j-1] * M) % mod

ans = 0
for i in range(L):
    inv_Bi = pow(B[i], mod - 2, mod)
    t = (p[L - 1 - i] * A[i]) % mod
    t = (t * (P * inv_Bi % mod)) % mod
    ans = (ans + t) % mod

print(ans)