Count the Arrays

Count the Arrays

Your task is to calculate the number of arrays such that:

• each array contains n elements;
• each element is an integer from 1 to m;
• for each array, there is exactly one pair of equal elements;
• for each array a, there exists an index $i$ such that the array is strictly ascending before the $i-th$ element and strictly descending after it (formally, it means that $aj<aj+1$, if $j<i$, and $aj>aj+1$, if $j\ge i$).

Input

The first line contains two integers $n$ and $m(2\le n\le m\le 2\cdot 10^5).$

Output

Print one integer — the number of arrays that meet all of the aforementioned conditions, taken modulo 998244353.

Examples
input
3 4
output
6
input
3 5
output
10
input
42 1337
output
806066790
input
100000 200000
output
707899035