Preparing NOJ

*n* people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins *k* games in a row. This player becomes the winner.

For each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.

The first line contains two integers: *n* and *k* (2 ≤ *n* ≤ 500, 2 ≤ *k* ≤ 10^{12}) — the number of people and the number of wins.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*) — powers of the player. It's guaranteed that this line contains a valid permutation, i.e. all *a*_{i} are distinct.

Output a single integer — power of the winner.

2 2

1 2

2

4 2

3 1 2 4

3

6 2

6 5 3 1 2 4

6

2 10000000000

2 1

2

Games in the second sample:

3 plays with 1. 3 wins. 1 goes to the end of the line.

3 plays with 2. 3 wins. He wins twice in a row. He becomes the winner.

Info

Provider CodeForces

Origin Codeforces Round #443 (Div. 2)

Code CF879B

Tags

data structuresimplementation

Submitted 155

Passed 29

AC Rate 18.71%

Date 03/04/2019 16:08:40

Related