Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

data structures

greedy

two pointers

*2000

No tag edit access

The problem statement has recently been changed. View the changes.

×
G. Castle Defense

time limit per test

1.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputToday you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remaining side is occupied by a long wall that is split into *n* sections. At this moment there are exactly *a*_{i} archers located at the *i*-th section of this wall. You know that archer who stands at section *i* can shoot orcs that attack section located at distance not exceeding *r*, that is all such sections *j* that |*i* - *j*| ≤ *r*. In particular, *r* = 0 means that archers are only capable of shooting at orcs who attack section *i*.

Denote as defense level of section *i* the total number of archers who can shoot at the orcs attacking this section. Reliability of the defense plan is the minimum value of defense level of individual wall section.

There is a little time left till the attack so you can't redistribute archers that are already located at the wall. However, there is a reserve of *k* archers that you can distribute among wall sections in arbitrary way. You would like to achieve maximum possible reliability of the defence plan.

Input

The first line of the input contains three integers *n*, *r* and *k* (1 ≤ *n* ≤ 500 000, 0 ≤ *r* ≤ *n*, 0 ≤ *k* ≤ 10^{18}) — the number of sections of the wall, the maximum distance to other section archers can still shoot and the number of archers yet to be distributed along the wall. The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 10^{9}) — the current number of archers at each section.

Output

Print one integer — the maximum possible value of defense plan reliability, i.e. the maximum possible value of minimum defense level if we distribute *k* additional archers optimally.

Examples

Input

5 0 6

5 4 3 4 9

Output

5

Input

4 2 0

1 2 3 4

Output

6

Input

5 1 1

2 1 2 1 2

Output

3

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/02/2023 05:22:26 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|