#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int m, cnt, w[N];

inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }


ll v[N], s[N];
char n[N];
int main() {
    ll m;
    cin >> m >> n;
    ll p = 1, a = 1, res = 0;
    int len = strlen(n);
    for (int i = len - 1; i >= 0; i--) {
        int x = n[i] - '0';
        ll r = m - 1;
        while (r % 10 != x) r--;
        ll c = (r - x) / 10 + 1;
        if (i == 0 && n[i] == '0') c--;
        c %= MOD;
        v[i] = c;
        s[i] = c * ((r + x) % MOD) % MOD * qmi(2, MOD - 2, MOD) % MOD;
        s[i] = s[i] * p % MOD;
        
        p = p * m % MOD;
        a = a * c % MOD;
    }
    for (int i = 0; i < len; i++) {
        res = (res + a * s[i] % MOD * qmi(v[i], MOD - 2, MOD)) % MOD;
    }
    
    ll t = res;
    printf("%lld\n", t);
    return 0;
}