#include <bits/stdc++.h>
using namespace std;
const long long p = 998244353;
const long long maxn = 4e6 + 5;
long long in[maxn];
long long po(long long a, long long b) {
  if (b == 1) return a;
  if (b & 1) {
    long long u = po(a, b - 1);
    return (a * u) % p;
  } else {
    long long u = po(a, b >> 1);
    return (u * u) % p;
  }
}
long long inv(long long x) { return po(x, p - 2); }
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (long long i = 1; i < maxn; ++i) {
    if (i % 2 == 0 && i > 2) {
      in[i] = in[i / 2] * in[2];
      in[i] %= p;
      continue;
    }
    if (i % 3 == 0 && i > 3) {
      in[i] = in[i / 3] * in[3];
      in[i] %= p;
      continue;
    }
    in[i] = inv(i);
  }
  long long n, m;
  cin >> n >> m;
  long long f[n + 1];
  long long g[n + 1];
  g[1] = 1;
  for (long long i = 2; i <= n; ++i) {
    g[i] = 1 + ((g[i - 1] * (i - 1)) % p * in[m + i - 1]) % p;
    g[i] %= p;
  }
  f[0] = 1;
  for (long long i = 1; i <= n; ++i) {
    long long ans = (m + i) * in[i];
    ans %= p;
    ans += ((f[i - 1] * (m + i + 1)) % p) * in[m + i];
    ans %= p;
    ans -= g[i] * in[i + m];
    ans %= p;
    f[i] = ans;
  }
  cout << (f[n] % p + p) % p;
  return 0;
}
