#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;

const int N = 3e5 + 10;
const int B = 800;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
void add(int &a, int b) { (a += b) >= P ? a -= P : 1; }
void sub(int &a, int b) { (a -= b) < 0 ? a += P : 1; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, c, ans;

namespace small {

  const int M = 1.3e3 + 10;
  const int L = 1.3e3;

  int f[M][M];

  void Main() {
    for (int i = 1, o = 1; i <= n; ++ i, o = (o + 1) % M) {
      fill(f[o] + 1, f[o] + L + 1, 0);
      if (i <= B) f[o][i] = 1;
      // cout << "i, o = " << i << ' ' << o << endl;
      rep(j, 1, L) {
        add(f[o][j], f[(o - j + M) % M][j - 1]);
        add(f[o][j], mul(f[(o - j + M) % M][j + 1], c));
      }
    }
    rep(i, 1, B) add(ans, f[n % M][i]);
  }

}

namespace large {

  int c2[N], f[2][B * B];

  void Main() {
    rep(i, 1, B) c2[i] = c2[i - 1] + i - 1;
    f[1][0 + c2[B]] = 1;
    for (int i = 1, o = 1; i < B; ++ i, o ^= 1) {
      fill(f[o ^ 1], f[o ^ 1] + 2 * c2[B], 0);
      for (int x = B + 1; i * x - c2[i] <= n; ++ x) {
        int s = n - i * x;
        if (-c2[i] <= s && s <= c2[i]) add(ans, f[o][s + c2[B]]);
      }
      rep(s, -c2[i], c2[i]) if (f[o][s + c2[B]]) {
        add(f[o ^ 1][s + i + c2[B]], f[o][s + c2[B]]);
        add(f[o ^ 1][s - i + c2[B]], mul(f[o][s + c2[B]], c));
      }
    }
  }

}

int main() {
  n = read(), c = read();
  small::Main();
  large::Main();
  printf("%d\n", ans);
  return 0;
}