N
L
C< /code> (\(1 <= L, C <= N <= 1,000,000\)). Each of the following N lines contain one number, modulo not exceeding 1000. An example of the organization of source data in the input file (for L = 3 and C = 3): 5 3 3 1 -1 2 -2 3 Several sequences can be selected in this set, but with a maximum sum of 3 it will be: 2+(-2)+3. Answer(for С = 3 and L = 3): 3.  ;
= 3 and C = 3
С
= 3 and L = 3
2000 ms 256 Mb Rules for program design and list of errors in automatic problem checking