#include <bits/stdc++.h>
using namespace std;
const int P = 998244353; 
const int N = 3e5 + 5, B = 800, T = 330; 

int n, c, ans; 
int f[(B + T) * 2][B + T], g[2][N * 2]; // sum = i, lst = j

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> c; 
    const int BB = (B + T) * 2; 
    for (int i = 1; i <= n; ++i) {
        int I = i % BB; 
        for (int j = 1; j <= min(i, B + T - 1); ++j) {
            f[I][j] = 0; 
            if (j > 1) f[I][j] = (f[I][j] + f[(I - j + BB) % BB][j - 1]) % P; 
            if (j + 1 < B + T) f[I][j] = (f[I][j] + 1ll * f[(I - j + BB) % BB][j + 1] * c) % P; 
        }
        if (i < B) f[i][i] = 1; 
    }
    for (int i = 1; i <= min(n, B + T - 1); ++i) ans = (ans + f[n % BB][i]) % P; 

    if (n >= B) ++ans; 
    g[1][0 + N] = 1; 
    for (int i = 2, now = 0; i * B <= n * 2; ++i, now ^= 1)
        for (int j = max(-i * (i - 1) / 2, -i * B + 1); j <= min(i * (i - 1) / 2, n - i * B); ++j) {
            g[now][j + N] = (g[now ^ 1][j - (i - 1) + N] + 1ll * c * g[now ^ 1][j + (i - 1) + N]) % P; 
            if ((n - j) % i == 0) ans = (ans + g[now][j + N]) % P; 
        }
    cout << ans << "\n"; 
    return 0;
}