#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = (long long)998244353;

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}


template<typename type>
vector<vector<type>> product(vector<vector<type>> &a, vector<vector<type>> &b){
	vector<vector<type>> res(a.size(),vector<type>(b[0].size(),0));
	
	
	for(int i = 0; i < a.size(); i++){
		for(int j = 0; j < b[0].size(); j++){
			for(int k = 0; k < b.size(); k++){ 
				res[i][j] += a[i][k]*b[k][j];
				res[i][j] %= MOD;
			}
		}
	}
	
	return res;
}

template<typename type>
vector<vector<type>> matrix_power(vector<vector<type>> matrix, long long n){
	vector<vector<type>> res(matrix.size(), vector<type>(matrix.size(),0));
	
	for(int i = 0; i < matrix.size(); i++) res[i][i] = 1;
	
	for( ; n > 0; n >>= 1){
		if(n&1) res = product(res,matrix);
		matrix = product(matrix,matrix);
	}
	
	return res;
}
       
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	vector<vector<int>> matrix;
	int N, K;
	int ans = 0;
	
	cin>>N>>K;
	
	matrix.resize(K*K*K,vector<int>(K*K*K,0));

	
	for(int i = 0; i < K; i++){
		for(int j = 0; j < K; j++){
			for(int k = 0; k < K; k++){
				matrix[(i+1)%K*K*K + j*K + k][i*K*K + j*K + k]++;
				matrix[i*K*K + (i+j)%K*K + k][i*K*K + j*K + k]++;
				matrix[i*K*K + j*K + (j+k)%K][i*K*K + j*K + k]++;
			}
		}
	}
	
	matrix = matrix_power(matrix, N);
	
	for(int i = 0; i < K; i++){
		for(int j = 0; j < K; j++){
			ans += matrix[i*K*K + j*K][0];
			ans %= MOD;
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}