mod = 998244353
M = int(input())
C = [0 for _ in range(10)]
S = [0 for _ in range(10)]
for c in range(10):
  r = M % 10
  n = (M // 10) + (r > c)
  C[c] = n % mod
  S[c] = n * c + 5 * n * (n - 1)
  S[c] %= mod

N = input()
ans = 0
res = 1
for i in range(len(N)):
  res = res * C[int(N[i])] % mod

for i in range(len(N)):
  ans = ans * M % mod
  n = int(N[i])
  c = res * pow(C[n], -1, mod) % mod
  ans = (ans + S[n] * c) % mod
print(ans)