Code Submission Evaluation System Login

CSES Problem Set

Maximum Subarray Sum II


Task | Statistics


CSES - Maximum Subarray Sum IICSES - Maximum Subarray Sum II

Time limit:1.00 s Memory limit:512 MB

Given an array of $n$ integers, your task is to find the maximum sum of values in a contiguous subarray with length between $a$ and $b$.

Input

The first input line has three integers $n$, $a$ and $b$: the size of the array and the minimum and maximum subarray length.

The second line has $n$ integers $x_1,x_2,\dots,x_n$: the array values.

Output

Print one integer: the maximum subarray sum.

Constraints
Example

Input:
8 1 2
-1 3 -2 5 3 -5 2 2


Output:
8