#include <iostream>
#include <tuple>
#include <vector>

#define REP(i,n) for (int i=0;i<(n);++i)

template <class T, T M>
class modulo {
public:
    T data;

    modulo(T data) : data(data % M) {
    }

    modulo operator+(const modulo &x) const {
        return modulo(data + x.data);
    }

    modulo operator*(const modulo &x) const {
        return modulo(data * x.data);
    }

    modulo operator+=(const modulo &x) {
        return data = (data + x.data) % M;
    }

    modulo operator*=(const modulo &x) {
        return data = (data * x.data) % M;
    }
};

template <class T>
class matrix {
public:
    size_t M;
    size_t N;
    std::vector<std::vector<T>> data;

    matrix(size_t M, size_t N) : M(M), N(N) {
        data.resize(M);
        for (int i = 0; i < M; ++i) {
            data[i].assign(N, 0);
        }
    }

    matrix operator*(const matrix &x) const {
        matrix result(M, x.N);
        for (int i = 0; i < M; ++i) {
            for (int j = 0; j < x.N; ++j) {
                T temp = 0;
                for (int k = 0; k < N; ++k) {
                    temp += data[i][k] * x.data[k][j];
                }
                result.data[i][j] = temp;
            }
        }
        return result;
    }

    template <class NonNegativeInteger>
    matrix pow(NonNegativeInteger n);
};

template <class T>
matrix<T> unit_matrix(size_t n) {
    matrix<T> result(n, n);
    for (int i = 0; i < n; ++i) {
        result.data[i][i] = 1;
    }
    return result;
}

template <class T>
template <class NonNegativeInteger>
matrix<T> matrix<T>::pow(NonNegativeInteger n) {
    matrix result = unit_matrix<T>(N);
    matrix x(*this);
    while (n) {
        if (n & 1) {
            result = result * x;
        }
        x = x * x;
        n >>= 1;
    }
    return result;
}



using namespace std;

using ull = unsigned long long;

constexpr ull MOD = 998244353;

int N;
int K;

int encode(int x, int y, int z) {
    return z * K*K + y * K + x;
}

tuple<int, int, int> decode(int b) {
    int x = b % K;
    int y = (b / K) % K;
    int z = b / (K*K);
    return make_tuple(x, y, z);
}
            
int main() {
    cin >> N >> K;

    int K3 = K * K * K;
    using M = modulo<ull, MOD>;
    matrix<M> A(K3, K3);
    REP(b, K3) {
        int x, y, z;
        tie(x, y, z) = decode(b);
        A.data[encode((x + 1) % K, y, z)][b] += 1;
        A.data[encode(x, (y + x) % K, z)][b] += 1;
        A.data[encode(x, y, (z + y) % K)][b] += 1;
    }
    matrix<M> u(K3, 1);
    u.data[0][0] = 1;
    matrix<M> B = A.pow(N);
    matrix<M> v = B * u;
    M result(0);
    REP(b, K * K) {
        result += v.data[b][0];
    }
    cout << result.data << endl;
    return 0;
}