Problem: zscoder has a deck of n+m custom-made cards, which consists of n cards labelled from 1 to n and m jokers. Since zscoder is lonely, he wants to play a game with himself using those cards. 

Initially, the deck is shuffled uniformly randomly and placed on the table. zscoder has a set S which is initially empty. 

Every second, zscoder draws the top card from the deck. 

  * If the card has a number x written on it, zscoder removes the card and adds x to the set S. 
  * If the card drawn is a joker, zscoder places all the cards back into the deck and reshuffles (uniformly randomly) the n+m cards to form a new deck (hence the new deck now contains all cards from 1 to n and the m jokers). Then, if S currently contains all the elements from 1 to n, the game ends. Shuffling the deck doesn't take time at all. 



What is the expected number of seconds before the game ends? We can show that the answer can be written in the form P/Q where P, Q are relatively prime integers and Q ≠ 0 mod 998244353. Output the value of (P ⋅ Q^{-1}) modulo 998244353.

Input

The only line of the input contains two integers n and m (1 ≤ n, m ≤ 2 ⋅ 10^{6}).

Output

Output a single integer, the value of (P ⋅ Q^{-1}) modulo 998244353.

Examples

Input


2 1


Output


5


Input


3 2


Output


332748127


Input


14 9


Output


969862773

Note

For the first sample, it can be proven that the expected time before the game ends is 5 seconds.

For the second sample, it can be proven that the expected time before the game ends is 28/3 seconds.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int maxn = 5000000 + 10;
const int maxm = 200000 + 10;
const int apsz = 26;
const int mod = 998244353;
inline int mul(int a, int b) {
  long long ans = 1LL * a * b;
  ans = ans - ans / mod * mod;
  if (ans < 0) ans += mod;
  assert(ans >= 0 && ans < mod);
  return ans;
}
inline int add(int a, int b) {
  long long ans = a + b;
  ans = ans - ans / mod * mod;
  if (ans < 0) ans += mod;
  assert(ans >= 0 && ans < mod);
  return ans;
}
inline int fpow(int a, int b) {
  int ans = 1;
  for (; b;) {
    if (b & 1) ans = mul(ans, a);
    a = mul(a, a);
    b >>= 1;
  }
  return ans;
}
int fac[maxn];
int inv[maxn];
int invfac[maxn];
int n, m;
inline int C(int a, int b) {
  if (a < b) return 0;
  return mul(mul(fac[a], invfac[b]), invfac[a - b]);
}
inline void init() {
  fac[0] = 1;
  for (auto i = (1); i < (maxn); ++i) fac[i] = mul(fac[i - 1], i);
  int now = fpow(fac[maxn - 1], mod - 2);
  for (auto i = (maxn - 1); i >= (1); --i) {
    inv[i] = mul(now, fac[i - 1]);
    now = mul(now, i);
  }
  invfac[0] = 1;
  for (auto i = (1); i < (maxn); ++i) {
    invfac[i] = mul(invfac[i - 1], inv[i]);
    assert(mul(invfac[i], fac[i]) == 1);
  }
}
inline void solve() {
  int sum = 0;
  int ans = 0;
  int pref1 = fac[m - 1];
  int pref2 = mul(-1, fac[m - 1]);
  for (auto x = (1); x <= (n); ++x) {
    pref2 = add(pref2, mul(mul(fac[m - 1 + x], invfac[x]), x - 1));
    pref1 = add(pref1, mul(fac[m + x - 1], invfac[x]));
    int co1 = mul(mul(mul(mul(fac[n - x], fac[x]), invfac[n + m]), m),
                  C(m + n, m + x));
    int co2 = mul(mul(mul(mul(fac[n - x], fac[x]), invfac[n + m]), m),
                  C(m + n + 1, m + x + 1));
    int tmp1 = mul(sum, co1);
    int tmp2 = mul(x, pref1);
    tmp2 = add(tmp2, -pref2);
    tmp2 = mul(tmp2, co2);
    int tmp3 = add(tmp1, tmp2);
    co1 = mul(co1, mul(fac[m - 1 + x], invfac[x]));
    ans = mul(tmp3, fpow(add(1, -co1), mod - 2));
    sum = add(sum, mul(ans, mul(fac[m + x - 1], invfac[x])));
  }
  printf("%d\n", ans);
}
int main(void) {
  init();
  scanf("%d%d", &n, &m);
  solve();
  return 0;
}