时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Given the sequence 
,ask the value of %20%5Cmod%20998241383)
wikipedia: k-permutations of n are the different ordered arrangements of a k-element subset of an n-set (sometimes called variations or arrangements in the older literature). These objects are also known as partial permutations or as sequences without repetition, terms that avoid confusion with the other, more common, meaning of "permutation". The number of such k-permutations of n is denoted variously by such symbols as
or _%7B%7D)
,and its value is given by the product %3D%5Cunderbrace%20%7Bn%5Ccdot%20(n-1)%5Ccdot%20(n-2)%5Ccdots%20(n-k%2B1)%7D%20_%7Bk%5C%20%5Cmathrm%20%7Bfactors%7D%20%7D)
,which is 
when 
, and otherwise is equal to !%7D%7D)
.
Assume that%20%3D%201%2C%20P(0%2C%200)%20%3D%201_%7B%7D)
wikipedia: k-permutations of n are the different ordered arrangements of a k-element subset of an n-set (sometimes called variations or arrangements in the older literature). These objects are also known as partial permutations or as sequences without repetition, terms that avoid confusion with the other, more common, meaning of "permutation". The number of such k-permutations of n is denoted variously by such symbols as
Assume that
输入描述:
The first line contains an integer— the number of test cases you need to solve.
The first line of each test case contains an integer.
The second line containsspace-separated integers
— the elements of the array a.
输出描述:
For each test case, print the result mod naughty.