시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 (추가 시간 없음) | 256 MB | 2 | 2 | 1 | 100.000% |
You are given a permutation $p_1, p_2, \dots, p_n$. You can do the following operations repeatedly:
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 $T$ denoting the number of test cases ($1\le T\le 100000$).
The first line in a test case contains two integers $n$ and $c$ ($2\le c \le 500000$, $2\le n\le 500000$). The sum of $n$ over all test cases does not exceed $500000$.
The second line in a test case contains a permutation $p_1,\ldots, p_n$ ($1\le p_i\le n$).
For each test case, output one line containing the answer modulo $998244353$.
5 5 3 3 4 2 1 5 5 4 4 2 1 3 5 5 2 4 5 3 1 2 5 3 4 3 2 1 5 5 2 2 3 1 5 4
6 1 4 6 4