#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

mint op(mint lhs, mint rhs){return lhs * rhs;};
mint e(){return 1;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll m;
    string n;
    cin >> m >> n;
    string s = to_string(m);
    const int d = s.size(), c = n.size();
    vector dp(d + 1, vector(2, vector<mint>(10))), dp2(d + 1, vector(2, vector<mint>(10)));
    dp[0][1][0] = 1;
    for(int i = 0; i < d; i++){
        for(int j = 0; j < 2; j++){
            const int r = j ? s[i] - '0' : 9;
            for(int k = 0; k < 10; k++){
                for(int l = 0; l <= r; l++){
                    dp[i + 1][(j & (l == r))][l] += dp[i][j][k];
                    dp2[i + 1][(j & (l == r))][l] += l * dp[i][j][k] + dp2[i][j][k] * 10;
                }
            }
        }
    }
    vector<mint> R(c + 1), L(c + 1);
    L[0] = R[c] = 1;
    for(int i = 0; i < c; i++){
        L[i + 1] = L[i] * (dp[d][0][n[i] - '0'] - (i == 0 && n[i] == '0'));
        R.rbegin()[i + 1] = R.rbegin()[i] * dp[d][0][n.rbegin()[i] - '0'];
    }
    mint ans, mod = m;
    for(int i = 0; i < c; i++){
        ans *= mod;
        ans += dp2[d][0][n[i] - '0'] * L[i] * R[i + 1];
    }
    cout << ans.val()  << '\n';
}