#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; reverse(s.begin(), s.end()); vector cnt(10, m / 10), l(10), r(10); vector rev(10); rep(i, 0, m % 10) cnt[i]++; rep(i, 0, 10) { rev[i] = mint(1) / mint(cnt[i]); l[i] = i; r[i] = i + (cnt[i] - 1) * 10; } mint ans = 0, kind = 1; rep(i, 0, s.size()) { kind *= cnt[s[i] - '0']; } mint ten = 1; mint div = mint(1) / mint(2); rep(i, 0, s.size()) { ans += ten * kind * (l[s[i] - '0'] + r[s[i] - '0']) * div; ten *= m; } cout << ans.val() << endl; }