//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
//#define AMARI 1000000007
#define el '\n'
#define El '\n'
#define YESNO(x) ((x) ? "Yes" : "No")
#define YES YESNO(true)
#define NO YESNO(false)
#define REV_PRIORITY_QUEUE(tp) priority_queue<tp,vector<tp>,greater<tp>>
#define NO_ANS(x) {cout << (x) << '\n'; return;}
template <typename T>
void inline VEC_UNIQ(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    return;
}

ll beki(ll a,ll b){
    ll ans = 1LL,temp = a % AMARI;
    while(b){
        if(b % 2){
            ans *= temp;
            ans %= AMARI;
        }
        temp *= temp;
        temp %= AMARI;
        b /= 2;
    }
    return ans;
}

inline ll gyakugen(ll a){
    return beki(a,AMARI - 2);
}

#define MULTI_TEST_CASE false
void solve(void){
    //問題を見たらまず「この問題設定から言えること」をいっぱい言う
    //一個回答に繋がりそうな解法が見えても、実装や細かい詰めに時間がかかりそうなら別の方針を考えてみる
    //ある程度考察しても全然取っ掛かりが見えないときは実験をしてみる
    //よりシンプルな問題に言い換えられたら、言い換えた先の問題を自然言語ではっきりと書く
    //複数の解法のアイデアを思いついた時は全部メモしておく
    //g++ -D_GLIBCXX_DEBUG -Wall -Wextra -O2 g.cpp -o o
    ll m;
    cin >> m;
    string s;
    cin >> s;
    int n = (int)s.size();
    reverse(s.begin(),s.end());
    vector<ll> l(n),r(n);
    vector<ll> haba(n);
    ll product = 1LL;
    for(int i = 0; i < n; i++){
        l[i] = (s[i] - '0');
        r[i] = l[i] + (m / 10LL) * 10LL;
        while(r[i] >= m)r[i] -= 10LL;
        assert(l[i] % 10 == r[i] % 10);
        haba[i] = (r[i] - l[i]) / 10LL; haba[i]++; haba[i] %= AMARI;
        r[i] %= AMARI;
        product *= haba[i];
        product %= AMARI;
    }
    m %= AMARI;

    ll ans = 0LL;
    ll val3 = 1LL;
    ll g2 = gyakugen(2);
    for(int i = 0; i < n; i++){
        ll val1 = product * gyakugen(haba[i]); val1 %= AMARI;
        ll val2 = r[i] + l[i]; val2 %= AMARI; val2 *= g2; val2 %= AMARI;
        val2 *= haba[i]; val2 %= AMARI;
        
        //cerr << val1 << ' ' << val2 << ' ' << val3 << ' ' << s[i] << el;
        ll temp = val1 * val2; temp %= AMARI;
        temp *= val3; temp %= AMARI;
        ans += temp; if(ans >= AMARI)ans -= AMARI;
        val3 *= m; val3 %= AMARI;
    }
    cout << ans % AMARI << El;
    return;
}

void calc(void){
    return;
}

signed main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE)cin >> t;
    while(t--){
        solve();
    }
    return 0;
}