Permutation

题号：NC201120
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

You are given a permutation $p_1, p_2, \dots, p_n$ . You can do the following operations repeatedly:

Choose an interval $p_{l}, p_{l+1}, \dots, p_{l+c} (l \geq 1, l+c \leq n)$ where $p_l$ is the smallest element in this interval, you can permutate $p_{l+1}, \dots, p_{l+c}$ in arbitrary way.
Choose an interval $p_{l}, p_{l+1}, \dots, p_{l+c} (l\geq 1, l+c \leq n)$ where $p_{l+c}$ is the smallest element in this interval, you can permutate $p_{l}, \dots, p_{l+c-1}$ in arbitrary way.

You want to know how many distinct permutations you can get using operations. The answer can be large, output the answer modulo ${998244353}$ .

输入描述:

The first line contains an integer  denoting the number of test cases ().
The first line in a test case contains two integers  and  (, ). The sum of  over all test cases does not exceed .
The second line in a test case contains a permutation  ().

输出描述:

For each test case, output one line containing the answer modulo .

示例1

输入

复制

输出

复制