Given are $a permutation p_1, p_2, \dots, p_N$ of (1, 2, ..., N) and an integer K. Maroon performs the following operation for $i = 1, 2, \dots, N - K + 1$ in this order:

• Shuffle $p_i, p_{i + 1}, \dots, p_{i + K - 1}$ uniformly randomly.

Find the expected value of the inversion number of the sequence after all the operations are performed, and print it modulo 998244353.

More specifically, from the constraints of this problem, it can be proved that the expected value is always a rational number, which can be represented as an irreducible fraction $\frac{P}{Q}$, and that the integer R that satisfies $R \times Q \equiv P \pmod{998244353}, 0 \leq R < 998244353$ is uniquely determined. Print this R.

Here, the inversion number of $a sequence a_1, a_2, \dots, a_N$ is defined to be the number of ordered pairs (i, j) that satisfy i < j, a_i > a_j.

Constraints

• $2 \leq N \leq 200,000$
• $2 \leq K \leq N$
• $(p_1, p_2, \dots, p_N)$ is a permutation of $(1, 2, \dots, N)$.
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
p_1 p_2 ... p_N

Output

Print the expected value modulo 998244353.

Examples

Input

3 2
1 2 3

Output

1

Input

10 3
1 8 4 9 2 3 7 10 5 6

Output

164091855

见题面

见题面