#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long power(long long base, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * base % mod;
    base = base * base % mod;
    b >>= 1;
  }
  return ret;
}
int n, m;
long long ans, cur;
int main() {
  scanf("%d%d", &n, &m);
  ans = 1LL * (n + m + 1) * power(m + 1, mod - 2) % mod;
  for (int i = 1; i <= n; ++i) {
    cur = (cur + power(i, mod - 2)) % mod;
  }
  cur = cur * m % mod + 1;
  printf("%lld", ans * cur % mod);
  return 0;
}
