#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

vector<vector<mint>> matrix_mul(const vector<vector<mint>> &a,
                                const vector<vector<mint>> &b) {
    int H1 = a.size();
    int W1 = a[0].size();
    int W2 = b[0].size();

    vector<vector<mint>> ans(H1, vector<mint>(W2, 0));

    for (int i = 0; i < H1; i++) {
        for (int k = 0; k < W1; k++) {
            mint aik = a[i][k];
            for (int j = 0; j < W2; j++) {
                ans[i][j] += aik * b[k][j];
            }
        }
    }
    return ans;
}

string N;

vector<mint> func(ll start) {
    vector<mint> dp(21, 0);
    dp[start] = 1;
    for (auto c : N) {
        vector<mint> ndp(21, 0);
        int n = c-'0';
        mint SUM = dp[n]*10+n*dp[n+10];
        mint cnt = dp[n+10];
        ndp[20] = dp[20]+SUM;
        rep (i, 10) {
            if (i == n) {
                ndp[i] += SUM;
                ndp[i+10] += dp[i+10];
            } else {
                ndp[i] += dp[i]+SUM;
                ndp[i+10] += dp[i+10]+cnt;
            }
        }
        dp = ndp;
    }
    return dp;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    ll K;
    cin >> N >> K;

    vector<vector<mint>> mat(21, vector<mint> (21, 0));
    rep (i, 21) {
        vector<mint> dp = func(i);
        rep (j, 21) {
            mat[j][i] = dp[j];
        }
    }

    vector<vector<mint>> ans(21, vector<mint> (1, 0));
    rep2 (i, 1, 10) {
        ans[i+10][0] = 1;
    }

    rep (i, 30) {
        if (1<<i & K) {
            ans = matrix_mul(mat, ans);
        }
        mat = matrix_mul(mat, mat);
    }

    print(ans[20][0].val());
}