#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#include <atcoder/convolution>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

void mul10(vector<Modint>& A){
    A.resize(A.size() + 9);
    rep(i,A.size()-1) A[i+1] += A[i];
    for(int i=A.size()-1; i>=10; i--) A[i] -= A[i-10];
}

vector<Modint> powdig(int N){
    if(N == 0){
        return vector<Modint>(1,1);
    }
    auto buf = powdig(N/2);
    auto A = atcoder::convolution(buf, buf);
    if(N%2 == 1) mul10(A);
    return A;
}

int main(){
    int N, K; cin >> N >> K;
    auto d1 = powdig(N/2);
    auto d0 = d1;
    if(N%2 == 1) mul10(d0);

    int Z = N + 1;
    vector<Modint> raizeK(Z+1); {
        vector<int> lpf(Z+1);
        raizeK[1] = 1;
        for(int p=2; p<=Z; p++){
            if(lpf[p]){ raizeK[p] = raizeK[lpf[p]] * raizeK[p/lpf[p]]; continue; }
            raizeK[p] = Modint(p).pow(K);
            for(int q=p*2; q<=Z; q+=p) lpf[q] = p;
        }
    }
    
    Modint ans = 0;
    rep(c0,99){
        vector<Modint> A(N/2+2);
        for(int c=c0; c<(int)d0.size(); c+=99) A[c/9] = d0[c];
        vector<Modint> B(N/2+2);
        rep(i,d1.size()) if((i*10+c0)%99 == 0) B[(i+8)/9] = d1[i];
        A = atcoder::convolution(A, B);
        rep(i,A.size()) ans += A[i] * raizeK[i];
    }
    ans *= Modint(9).pow(K);
    cout << ans.val() << endl;
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;