#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>

using namespace std;
using namespace atcoder;
using mint = modint998244353;
using ll = long long;
ll mod = 998244353;

ll modPow(ll a, ll n, ll mod){
    if(mod==1) return 0;
    ll ret = 1;
    ll p = a % mod;
    while(n){
        if (n & 1) ret = ret * p % mod;
        p = p * p % mod;
        n >>= 1;
    }
    return ret;
}

int main(){
    ll M;
    string N;
    cin >> M >> N;

    mint bpi = 1;
    ll Ns = N.size();
    reverse(N.begin(),N.end());
    vector<int> a(Ns);
    vector<mint> b(Ns);
    for(int i = 0; i < Ns; i++){
        a[i] = N[i] - '0';
        b[i] = (M-1-a[i]) / 10 + 1;
        bpi *= b[i];
    }
    
    mint ans = 0;
    for(int i = 0; i < Ns; i++){
        ans += modPow(M,i,mod) * bpi * (2 * a[i] + 10 * (b[i]-1)) / 2;
    }
    cout << ans.val() << endl;
}