#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 998244353;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

using vec = vector<ll>;
using mat = vector<vec>;

mat mul(mat& A, mat& B) {
    mat C(A.size(), vec(B[0].size(), 0));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < B[0].size(); j++) {
                (C[i][j] += A[i][k] * B[k][j] % MOD) %= MOD;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n) {
    mat B(A.size(), vec(A.size(), 0));
    for (int i = 0; i < A.size(); i++) {
        B[i][i] = 1;
    }
    while (n > 0) {
        if (n & 1) B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    int K;
    cin >> n >> K;
    int m = K * K * K;
    mat A(m, vec(m, 0));
    for (int idx = 0; idx < m; idx++) {
        int i = idx % K;
        int j = idx / K % K;
        int k = idx / (K * K) % K;

        int idx1 = (i + 1) % K + j * K + k * K * K;
        int idx2 = i + (j + i) % K * K + k * K * K;
        int idx3 = i + j * K + (j + k) % K * K * K;
        A[idx1][idx]++;
        A[idx2][idx]++;
        A[idx3][idx]++;
    }

    A = pow(A, n);
    mat B(m, vec(1, 0));
    B[0][0] = 1;
    mat C = mul(A, B);
    ll ans = 0;
    for (int i = 0; i < K; i++) {
        for (int j = 0; j < K; j++) {
            (ans += C[i + j * K][0]) %= MOD;
        }
    }
    cout << ans << "\n";
    return 0;
}