MOD = 998244353
M = int(input())
N = input()

L = len(N)
N = [ord(N[i]) - ord('0') for i in range(L)]

k = [-1] * 10
for s in range(10):
    ok, ng = 0, 1 << 62
    while ng - ok > 1:
        mid = (ok + ng) >> 1
        if 10 * mid + s < M:
            ok = mid
        else:
            ng = mid
    
    k[s] = ok

X = 1
c = [-1] * L
for i in range(L):
    if i == 0 and N[i] == 0:
        c[i] = k[N[i]]
    else:
        c[i] = k[N[i]] + 1
    X = (X * c[i]) % MOD

pM = [1]
while len(pM) <= L:
    pM.append(pM[-1] * M % MOD)

acc = [(5 * k[i] * (k[i] + 1) + i * (k[i] + 1)) % MOD for i in range(10)]

ans = 0
for i in range(L):
    ans += acc[N[i]] * pM[L - 1 - i] * X * pow(c[i], MOD - 2, MOD)
    ans %= MOD
print(ans)