Codeforces Global Round 10 |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

combinatorics

dp

math

probabilities

*3000

No tag edit access

The problem statement has recently been changed. View the changes.

×
H. ZS Shuffles Cards

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputzscoder 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 $$$\frac{P}{Q}$$$ where $$$P, Q$$$ are relatively prime integers and $$$Q \neq 0 \bmod 998244353$$$. Output the value of $$$(P \cdot Q^{-1})$$$ modulo $$$998244353$$$.

Input

The only line of the input contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n, m \le 2 \cdot 10^{6}$$$).

Output

Output a single integer, the value of $$$(P \cdot 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 $$$\frac{28}{3}$$$ seconds.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/29/2024 19:04:52 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|