// #define DEBUGGING #include using namespace std; #define endl '\n' #define ALL(V) (V).begin(), (V).end() #define ALLR(V) (V).rbegin(), (V).rend() template using V = vector; template using VV = V>; template using P = pair; using ll = int64_t; using PLL = P; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); } template const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); } template void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); } namespace init__ { struct InitIO { InitIO() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(30); } } init_io; } #ifdef DEBUGGING #include "../debug.cpp" #else #define DEBUG(...) 0 #define DEBUG_SEPARATOR_LINE 0 #endif template T make_v(T init) { return init; } template auto make_v(T init, size_t s, Tail... tail) { #define rec make_v(init, tail...) return V(s, rec); #undef rec } const ll mod = 998244353; using Mat = VV; Mat make_mat(ll r, ll c) { return move(make_v(0, r, c)); } Mat make_id(ll r, ll c) { auto ret = make_v(0, r, c); for(ll i = 0; i < min(r, c); i++) ret[i][i] = 1; return move(ret); } Mat make_id(const Mat &a) { return move(make_id(a.size(), a[0].size())); } Mat operator*(const Mat &a, const Mat &b) { Mat ret = make_mat(a.size(), b[0].size()); for(ll i = 0; i < ret.size(); i++) { for(ll j = 0; j < ret[0].size(); j++) { ll tmp = 0; for(ll k = 0; k < a[0].size(); k++) (tmp += a[i][k] % mod * b[k][j] % mod) %= mod; ret[i][j] = tmp; } } return move(ret); } Mat pow__(Mat a, ll b) { return b ? (b & 1 ? a : make_id(a)) * pow__(a * a, b / 2) : make_id(a); } ll pow__(ll a, ll b) { return b ? (b & 1 ? a : 1) * pow__(a * a % mod, b / 2) % mod : 1; } int main() { ll N, K; cin >> N >> K; Mat mat = make_mat(K * K * K, K * K * K); Mat init = make_mat(K * K * K, 1); init[0][0] = 1; auto make_idx = [&](ll a, ll b, ll c) { ll ret = 0; ll tmp[] = { a, b, c, }; for(ll i = 0; i < 3; i++) { ret = ret * K + tmp[i] % K; } return ret; }; for(ll i = 0; i < mat.size(); i++) { ll homura = i % K; ll homu = i / K % K; ll ho = i / K / K % K; mat[i][make_idx(ho, homu, homura + homu)]++; mat[i][make_idx(ho, homu + ho, homura)]++; mat[i][make_idx(ho + 1, homu, homura)]++; } mat = pow__(mat, N); init = mat * init; ll ans = 0; for(ll i = 0; i < init.size(); i++) { if(i % K) continue; (ans += init[i][0]) %= mod; } cout << ans << endl; return 0; }