Avoid the bomb shot! Blue Padaengi!

Padaengi studied hard in school and entered Dangdaeng University. Padaengi wanted to enjoy the joy of this success on an MT trip, but Padaengi does not drink well and is very worried.

If the others found out, they would become close without Padaengi, so Padaengi hid the fact and joined the drinking game.

The drinking game is a pairing game. $N$ zones are lined up in a row. Each dog enters the zone of its choice, and dogs in the same zone start as one group. Then each group forms a team with another group, and they must gather into groups of $M$ dogs within $T$ seconds. When a group joins another group, no member may leave it, and even before teaming up, a group cannot let any of its members leave. A dog that is not in a group of $M$ dogs within the time limit, or that breaks the rules, must drink the bomb shot as a penalty.

The other dogs stay where they are and wait for someone to take them. Padaengi fears the bomb shot and plans to lead a group of $M$ dogs personally. If Padaengi is in zone $P$, Padaengi can move to zone $P-1$ or zone $P+1$ in 1 second, and can take or pass through the group in that zone. Taking another group costs no time, and Padaengi can still take another group at the exact moment $T$ seconds have passed since the game started.

Can Padaengi gather $M$ dogs within the time limit $T$ seconds and avoid the bomb shot?

The first line contains three integers: the number of zones $N$, the number $M$ set by the host, and the time limit $T$ in seconds, separated by spaces. $(1 \le N \le 100, 1 \le M \le 100,000, 1 \le T \le 100)$

The second line contains integers $Q_{1}, Q_{2}, \cdots, Q_{N}$, the number of dogs in each group in zones 1 through $N$, separated by spaces. $(1 \le Q_{i} \le 1,000)$

The third line contains the integer $P$, the zone where Padaengi's group is located at the start. $(1 \le P \le N)$

Print YES if Padaengi can avoid the bomb shot, and NO otherwise.