#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

#include "atcoder/convolution"
#include "atcoder/modint"

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using mint = atcoder::modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, K;
    cin >> N >> K;

    auto dfs = [&](auto self, int l, int r) -> vector<mint> {
        if (r - l == 1) {
            vector<mint> init(10, 1);
            return init;
        }
        int m = (l + r) >> 1;
        auto L = self(self, l, m), R = self(self, m, r);
        return atcoder::convolution(L, R);
    };
    auto calc = [&](int n) { return dfs(dfs, 0, n); };
    auto odd = calc(N / 2), even = calc(N - N / 2);

    mint ans = 0;
    for (int i = 0; i < 11; i++) {
        auto a = odd, b = even;
        for (int j = 0; j < int(a.size()); j++) {
            if (j % 11 != i) {
                a[j] = 0;
            }
        }
        for (int j = 0; j < int(b.size()); j++) {
            if (j % 11 != i) {
                b[j] = 0;
            }
        }
        auto c = atcoder::convolution(a, b);
        for (int j = 0; j < int(c.size()); j += 9) ans += c[j] * mint(j).pow(K);
    }

    cout << ans.val() << '\n';
    return 0;
}