#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
mint tousa(int a, ll loop){
    mint b = mint(a);
    mint c = mint(10)*mint(loop-1) + b;
    return (b+c)*mint(loop)/mint(2);
}
int toi(char c){
    return c - '0';
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll m; cin >> m;
    string n; cin >> n;
    if(m == 10){
        if(n[0] == '0'){
            cout << 0 << endl;
            return 0;
        }
        mint h = mint(1);
        mint a = mint(0);
        drep(i, n.length()){
            a += h*mint(toi(n[i]));
            h *= mint(10);
        }
        cout << a.val() << endl;
        return 0;
    }
    int len = n.length();
    vll cnt(len);
    rep(i, len)cnt[i] = (m-toi(n[i])-1)/10 + 1;
    if(n[0] == '0')cnt[0]--;
    mint cc = mint(1);
    rep(i, len-1)cc *= mint(cnt[i]);
    mint ans = 0;
    mint base = 1;
    drep(i, len){
        int d = (i == 0 && n[i] == '0') ? 10 : toi(n[i]);
        ans += base * tousa(d, cnt[i]) * cc;
        if(i == 0)break;
        cc *= mint(cnt[i]);
        if(mint(cnt[i-1]).val() > 0){
            cc *= mint(cnt[i-1]).inv();
        }
     
       base *= mint(m);
    }
    cout << ans.val() << endl;


    return 0;
}