#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
inline ostream &operator<<(ostream &os, const mint x)
{
    return os << x.val();
};
inline istream &operator>>(istream &is, mint &x)
{
    long long v;
    is >> v;
    x = v;
    return is;
};

struct Fast
{
    Fast()
    {
        std::cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << setprecision(10);
    }
} fast;

#define all(a) (a).begin(), (a).end()
#define contains(a, x) ((a).find(x) != (a).end())
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";

using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vi = vector<int>;
using vvi = vector<vi>;

void solve()
{
    ll m;
    cin >> m;
    string s;
    cin >> s;

    vm cnt(10), sum(10);
    rep(d, 0, 10)
    {
        cnt[d] = (m - d + 9) / 10;
        sum[d] = cnt[d] * (cnt[d] - 1) * 5 + cnt[d] * d;
    }

    int n = s.size();
    vm pr(n + 1, 1);
    rep(i, 0, n)
        pr[i + 1] = pr[i] * cnt[s[i] - '0'];

    mint ans = 0, prod = 1;
    rrep(i, 0, n)
    {
        int c = s[i] - '0';
        ans += pr[i] * prod * sum[c];
        prod *= cnt[c];
        prod *= m;
    }
    cout << ans << "\n";
}

int main()
{
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}