#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>
#include <atcoder/convolution>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

vector<mint> pow(vector<mint> v, int n){
    vector<mint> ans = {mint(1)};
    while (n > 0) {
        if (n&1) ans = atcoder::convolution(ans, v);
        v = atcoder::convolution(v, v);
        n >>= 1;
    }
    return ans;
}

int sum_digits(int n){
    int sum = 0;
    while(n){
        sum += n%10;
        n /= 10;
    }
    return sum;
}



int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    vector<mint> x(10, mint(1));
    auto v = pow(x, n/2);
    auto u = pow(x, (n+1)/2);
    mint ans = 0;
    for(int r = 0; r < 11; r++){
        auto vv = v;
        auto uu = u;
        for(int i = 0; i < vv.size(); i++){
            if(i%11 != r) vv[i] = 0;
        }
        for(int i = 0; i < uu.size(); i++){
            if(i%11 != r) uu[i] = 0;
        }
        auto ww = atcoder::convolution(vv, uu);
        for(int i = 0; i < ww.size(); i++){
            if(i%9 == 0) ans += ww[i]*(mint(i).pow(k));
        }
    }
    cout << ans << endl;
}