#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long m; cin >> m;
	string n; cin >> n;
	vector<mint>th(n.size());
	vector<mint>sum(n.size());
	mint inv2 = mint(2).inv();
	mint tot = 1;
	rep(i, n.size()) {
		int x = n[i] - '0';
		long long c = 1 + (m - 1 - x) / 10;
		mint l = x;
		mint r = l + ((mint)c - 1) * 10;
		sum[i] = (l + r) * c * inv2;
		th[i] = c;
	}
	int sz = n.size();
	vector<mint>l(n.size() + 1, 1), r(n.size() + 1, 1);
	rep(i, sz)l[i + 1] = l[i] * th[i];
	reverse(all(th));
	rep(i, sz)r[i + 1] = r[i] * th[i];
	mint ans = 0;
	rep(i, n.size()) {
		int x = i;
		int y = sz - 1 - x;
		ans += sum[i] * l[x] * r[y] * pow_mod(m, n.size() - 1 - i, mod);
	}
	cout << ans.val() << endl;
	return 0;
}