时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 128 M，其他语言256 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 128 M，其他语言256 M
64bit IO Format: %lld
题目描述
You are given three integers: k, S)
and a prime number p)
. And x is an integer array of length k.
We define Ans as:%5B%5Csum_%7Bi%3D1%7D%5Ekx_i%5Cleq%20S%5D)
.
Assuming P a proposition, then we have 
.
Please calculate the Ans mod p.
输入描述:
Three integer numbers, k, Sand a prime number p
输出描述:
An integer, Ans mod p.
