#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    long D;
    string S;
    cin >> D >> S;
    int N = S.size();
    vector<long> ds(N);
    for (int i = 0; i < N; i++) {
        int ch = S[i] - '0';
        ds[i] = (D - ch + 9) / 10;
        // cout << ds[i] << " \n"[i == N - 1];
    }
    vector<mint> sum(N);
    for (int i = 0; i < N; i++) {
        int ch = S[i] - '0';
        sum[i] = mint::raw(1) * (ch + 5 * (ds[i] - 1)) * ds[i];
        sum[i] *= mint::raw(D).pow(N - i - 1);
        // cout << sum[i].val() << " \n"[i == N - 1];
    }
    mint prod = 1;
    for (int i = 0; i < N; i++) prod *= ds[i];
    mint ans = 0;
    for (int i = 0; i < N; i++) {
        prod /= ds[i];
        ans += sum[i] * prod;
        prod *= ds[i];
    }
    if (S[0] == '0') ans--;
    cout << ans.val() << "\n";
}