#include <bits/stdc++.h>
 
using namespace std;

const long long int MOD = 998244353;

vector <vector<long long int>> mul(vector <vector<long long int>> a, vector<vector<long long int>> b)
{
	int n = a.size();
	int m = a[0].size();
	int k = b[0].size();
	vector <vector<long long int>>c(n, vector<long long int>(k,0));

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < k; j++)
		{
			for (int k = 0; k < m; k++)
			{
				c[i][j] += ((a[i][k]%MOD) * (b[k][j]%MOD)%MOD);
				c[i][j] %= MOD;
			}
		}
	}

	return c;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n,k;

    cin >> n >> k;

	vector <vector<long long int>> A(k*k*k,vector<long long int>(k*k*k,0));
	vector <vector<long long int>> B(k*k*k,vector<long long int>(k*k*k,0));

    B[0][0] = 1;

    for(int a=0;a<k;a++)
    {
        for(int b=0;b<k;b++)
        {
            for(int c=0;c<k;c++)
            {
                int u = k*k*a + b*k + c;
                int v = ((a+1)%k)*k*k + b*k + c;
                A[v][u] += 1;
                v = a*k*k + ((a+b)%k)*k + c;
                A[v][u] += 1;
                v = a*k*k + b*k + (b+c)%k;
                A[v][u] += 1;   
            }
        }
    }

	while(n>0)
	{
		if(n%2==1)
		{
			B = mul(A,B);
		}
		A = mul(A,A);
		n/=2;
	}

	//cout << b[14*A + B][14*A + B] << '\n';
	long long int res = 0;
	for(int i=0;i<k;i++)
    {
        for(int j=0;j<k;j++)
        {
            res += B[i*k*k + j*k][0];
            res%=MOD;   
        }
    }

	cout << res << '\n';
	

    return 0;
}