#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
int k;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c;
	for(int i=0; i<l; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			ll x=0;
			for(int k=0; k<m; k++){
				x+=(a[i][k]*b[k][j]);
				x%=MOD;
			}
			v.push_back(x);
		}
		c.push_back(v);
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans;
	for(int i=0; i<n; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			if(i==j){
				v.push_back(1);
			}else{
				v.push_back(0);
			}
		}
		ans.push_back(v);
	}
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
    ll n; cin>>n>>k;
    vector<vector<ll>> mat(k*k*k, vector<ll>(k*k*k));
    for(int i=0; i<k*k*k; i++){
        int i0=i;
        int x=i0%k; i0/=k;
        int y=i0%k; i0/=k;
        int z=i0;
        mat[(x+1)%k+y*k+z*k*k][i]++;
        mat[x+(x+y)%k*k+z*k*k][i]++;
        mat[x+y*k+(y+z)%k*k*k][i]++;
    }
    vector<vector<ll>> mp=matrixpow(k*k*k, mat, n);
    ll ans=0;
    for(int i=0; i<k*k; i++) (ans+=mp[i][0])%=MOD;
    cout<<ans<<endl;
    return 0;
}