#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

const int MOD = 998244353;

vector<vector<int> > mulMatMod(const vector<vector<int> > &A, const vector<vector<int> > &B) {
    auto n = (int)A.size(), m = (int)A[0].size(), p = (int)B[0].size();
    vector<vector<int> > res(n, vector<int>(p));
    for (int i = 0; i < n; ++i)for (int j = 0; j < p; ++j) for (int k = 0; k < m; ++k)
        res[i][j] = (int)((res[i][j] + (long long)A[i][k] * B[k][j]) % MOD);
    return res;
}

vector<vector<int> > powMatMod(vector<vector<int> > A, long long k) {
    auto n = (int)A.size();
    vector<vector<int> > res(n, vector<int>(n));
    for (int i = 0; i < n; ++i)res[i][i] = 1;
    while (k) {
        if (k % 2)res = mulMatMod(res, A);
        k /= 2;
        A = mulMatMod(A, A);
    }
    return res;
}

void solve() {
    int N, K;
    cin >> N >> K;
    auto f = [&](int h, int m, int r) {
        return h * K * K + m * K + r;
    };

    int M = K * K*K;
    vector<vi> A(M, vi(M));
    rep(h, K)rep(m, K)rep(r, K) {
        int x = f(h, m, r);
        int hh = f((h + 1) % K, m, r);
        int mm = f(h, (h + m) % K, r);
        int rr = f(h, m, (m + r) % K);
        A[hh][x]++;
        A[mm][x]++;
        A[rr][x]++;
    }
    auto B = powMatMod(A, N);
    int ans = 0;
    rep(h, K)rep(m, K) (ans += B[f(h, m, 0)][0]) %= MOD;
    cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}