题号：NC223762
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
You are given an n, you can easily arrangement all the permutations with1 to 
. Now little C gives you m different numbers,values are in the range of 
, m in the range of 
and one other number x that does not appear in 
, the 
value in the range of .Now you are asked to figure out the number of legitimate permutations where comes after different numbers in all the permutations with1 to n. If the number of permutations is too large, take the modulus of 998244353
输入描述:
The first line contains three integers。
输出描述:
Print one integer — the number of permutations