/**
	author:  shobonvip
	created: 2025.04.04 21:44:11
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll m; cin >> m;
	string s; cin >> s;
	int n = (int)s.size();
	vector<ll> a((int)s.size());
	int p = 0;
	for (char c: s){
		a[p++] = c - '0';
	}

	mint inv2 = mint(2).inv();
	vector<mint> nums(n);
	rep(i,0,n) {
		if (i == 0 && a[i] == 0) {
			ll v = (m + 9) / 10 - 1;
			nums[i] = v;
			//cout << v << endl;
			//ans += mint(v) * (v + 1) * inv2 * mint(10).pow(n-i-1);
		}else{
			ll v = (m + 9 - a[i]) / 10;
			nums[i] = v;
			//cout << v << endl;
			//ans += mint(v) * (v + 1) * inv2 * mint(10).pow(n-i-1);
		}
	}

	vector<mint> ruileft(n + 1, 1);
	vector<mint> ruiright(n + 1, 1);
	rep(i,0,n) {
		ruileft[i+1] = ruileft[i] * nums[i];
	}
	rrep(i,0,n){
		ruiright[i] = ruiright[i+1] * nums[i];
	}

	mint ans = 0;
	rep(i,0,n) {
		mint keis = ruileft[i] * ruiright[i+1];
		if (i == 0 && a[i] == 0) {
			ll v = (m + 9) / 10 - 1;
			ans += mint(v) * (v + 1) * mint(10) * inv2 * mint(m).pow(n-i-1) * keis;
			ans += a[i] * v * mint(m).pow(n-i-1) * keis;
		}else{
			ll v = (m + 9 - a[i]) / 10;
			ans += mint(v) * (v - 1) * mint(10) * inv2 * mint(m).pow(n-i-1) * keis;
			ans += a[i] * v * mint(m).pow(n-i-1) * keis;
		}
		//cout << ans.val()<<endl;
	}
	cout << ans.val() << endl;
}