#include #include #define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++) using namespace atcoder; using namespace std; typedef long long ll; using mint = modint998244353; template ostream &operator<<(ostream &os, const vector &v) { int n = v.size(); rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; } return os; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll m; string s; cin >> m >> s; int zerolen = 0; rep(i, 0, 1) { if (s[i] == '0') { s[i] += 10; } else { break; } } reverse(s.begin(), s.end()); vector cnt(11, m / 10), l(11), r(11), md(11); rep(i, 0, m % 10) cnt[i]++; rep(i, 0, 10) { l[i] = i; r[i] = i + (cnt[i] - 1) * 10; md[i] = (l[i] + r[i]) / 2; } cnt[10] = cnt[0] - 1; l[10] = l[0] + 10; r[10] = r[0]; md[10] = (l[10] + r[10]) / 2; mint ans = 0, kind = 1; rep(i, 0, s.size()) kind *= cnt[s[i] - '0']; mint ten = 1; rep(i, 0, s.size()) { ans += ten * kind * md[s[i] - '0']; ten *= m; } cout << ans.val() << endl; }