#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<vector<mint>> mul(vector<vector<mint>>&A, vector<vector<mint>>&B) {
	vector<vector<mint>> C(A.size(), vector<mint>(B[0].size()));
	rep(i, A.size()) rep(j, B[0].size()) rep(k, A[0].size()) C[i][j] += A[i][k] * B[k][j];
	return C;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	int sz = m * m * m;
	vector<vector<mint>> mans(sz, vector<mint>(sz));
	rep(i, sz)mans[i][i] = 1;
	vector<vector<mint>> mpow(sz, vector<mint>(sz));
	rep(i, m)rep(j, m)rep(k, m) {
		int y = (i * m + j)*m + k;
		{
			int ni = (i + 1) % m;
			int nj = j;
			int nk = k;
			int x = (ni * m + nj)*m + nk;
			mpow[x][y]++;
		}
		{
			int ni = i;
			int nj = (i + j) % m;
			int nk = k;
			int x = (ni * m + nj)*m + nk;
			mpow[x][y]++;
		}
		{
			int ni = i;
			int nj = j;
			int nk = (j + k) % m;
			int x = (ni * m + nj)*m + nk;
			mpow[x][y]++;
		}
	}
	//mpow初期化
	n--;
	while (n > 0) {
		if (1 == n % 2) mans = mul(mpow, mans);
		mpow = mul(mpow, mpow);
		n /= 2;
	}
	mint ans = 0;
	rep(i, sz) {
		if (0 != i % m)continue;
		ans += mans[i][0] * 2;
		ans += mans[i][m* m] * 1;
	}
	cout << ans.val() << endl;
	return 0;
}