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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair

const ll mod = 998244353;

#define MAXN 1'000'010

ll a[MAXN];
ll mpow[MAXN];

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll n, m;
	cin >> n >> m;
	mpow[0] = 1;
	rep(i, 1, n+1) mpow[i] = (mpow[i-1]*m)%mod;

	a[1] = m;
	//a[2] = m;
	ll sm = 0;
	rep(i, 2, n+1) {
		// number of ways to build previously
		if (i % 2 ==  0) {
			sm += a[i/2];
		}
		rep(j, 1, i+1) {
			if (2*j > i) break;
			if (i == n && 2*j == i) break;

			a[i] += a[j]*mpow[i-2*j];
			a[i] %= mod;
		}

		if (i != n) {
			a[i] = mpow[i]-a[i];
		}
		sm *= m;
		//sm += 
		//cout << i << ' ' << a[i] << endl;
	}
	cout << a[n] << endl;
	
}