Problem Statement

You are given positive integers $N$ and $M$.

A box contains one ball numbered $1$, one ball numbered $2$, $\dots$, one ball numbered $N$. There is also a blackboard with nothing written on it. Using these, Alice plays the following game.

First, Alice draws one ball from the box uniformly at random and keeps it at hand. Then, Alice performs the following sequence of operations $N-1$ times.

• Draw one ball from the box uniformly at random, independently of the previous operations, and keep it at hand.
• Write the sum of the numbers of the two balls at hand on the blackboard.
• Freely choose exactly one of the two balls at hand to discard, and keep the other at hand.

Alice's score in this game is defined as follows: it is $0$ if the maximum value of the integers written on the blackboard is $M$ or greater, and otherwise it is the number of the ball finally kept at hand.

Find the expected value, modulo $998244353$, of Alice's score when she acts to maximize the expected value of her score.

Definition of expected value modulo $998244353$ It can be proved that the sought expected value is always a rational number. Also, under the constraints of this problem, it can be proved that when that value is represented as an irreducible fraction $\frac{A}{B}$, we have $B {{}\not\equiv{}} 0 \pmod{998244353}$. Therefore, there is a unique integer $C$ such that $C \times B \equiv A \pmod{998244353}, 0 \leq C < 998244353$. Report this $C$.

Constraints

• $2 \le N \le 3000$
• $1 \le M \le 2N$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

N M

Output

Output the answer.