时间限制 5000 ms 内存限制 65536 KB
题目描述
We define function g on an array as:
g([a0,a1,⋯,an−1])=(Σn−1l=0al) mod pn
Here, p is a given constant, and n is the length of the array.
You are given p and an array A and a length k.
You need to find the maximum value of g over all contiguous subarrays of A that are of length ≥ k.
输入格式
The first line of input contains T, the number of test cases. Each test case contains two lines. The first line of each test case contains three integers: N, p and k, respectively.
The second line of each test case contains N integers contained in array A.
1≤T≤10
1≤