#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = 3e5 + 5;
const int mod = 998244353;

int add(int x) {return x < mod ? x : x - mod;}

int s, c;
ll f[3000][3000];

int main()
{
    cin >> s >> c;
    for(int i = 0; i <= s; i++) f[i][i] = 1;
    for(int i = 1; i <= s; i++)
        for(int j = 1; j < i; j++)
            f[i][j] = (f[i][j] + f[i - j][j - 1] + f[i - j][j + 1] * c % mod) % mod;
    int ans = 0;
    for(int i = 1; i <= s; i++) ans = add(ans + f[s][i]);
    cout << ans << '\n';
    return 0;
}