#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
  char c = getchar();
  bool f = 0;
  x = 0;
  while (!isdigit(c)) f |= c == '-', c = getchar();
  while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  if (f) x = -x;
  return x;
}
template <class t>
inline void write(t x) {
  if (x < 0)
    putchar('-'), write(-x);
  else {
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
  }
}
const int N = 4e6 + 5, mod = 998244353;
int n, m, ans, T, fac[N], inv[N], iv[N];
int C(int n, int m) { return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod; }
signed main() {
  read(n);
  read(m);
  iv[1] = 1;
  for (int i = 2; i <= n + m; i++)
    iv[i] = 1ll * (mod - mod / i) * iv[mod % i] % mod;
  fac[0] = 1;
  for (int i = 1; i <= n + m; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[0] = 1;
  for (int i = 1; i <= n + m; i++) inv[i] = 1ll * inv[i - 1] * iv[i] % mod;
  for (int i = 1, pre = 0; i <= n + 1; i++) {
    int p = 1ll * (1 - pre + mod) * m % mod * iv[m + n - i + 1] % mod;
    pre = (pre + p) % mod;
    T = (T + 1ll * i * p) % mod;
  }
  for (int i = 1; i <= n; i++)
    ans = (ans +
           (i & 1 ? 1ll : mod - 1ll) * (i + m) % mod * iv[i] % mod * C(n, i)) %
          mod;
  write(1ll * ans * T % mod);
}
