CF879B.Table Tennis

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.

有 $n$ 个人排成一列打乒乓球。初始时，队伍最前面的两名选手进行一场比赛。之后，失败者移动到队尾，而获胜者则与队伍中下一位选手（即原第三位）比赛，依此类推。他们持续比赛，直到某位选手连续赢得 $k$ 场比赛，该选手即成为最终胜者。

对于每位参与者，已知其乒乓球实力值，且所有选手的实力值互不相同。在任意一场比赛中，实力值更高的选手总是获胜。请确定最终的胜者。

The first line contains two integers: n and k (2 ≤ n ≤ 500, 2 ≤ k ≤ 1012) — 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.

第一行包含两个整数：$n$ 和 $k$（$2 \leq n \leq 500$，$2 \leq k \leq 10^{12}$）—— 分别表示人数和获胜次数。

第二行包含 $n$ 个整数 $a_1,\,a_2,\,...,\,a_n$（$1 \leq a_i \leq n$）—— 表示各玩家的实力值。保证该行给出的是一个合法的排列，即所有 $a_i$ 互不相同。

Output a single integer — power of the winner.

输出一个整数——获胜者的实力值。

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.

第二个样例中的比赛过程：

3 与 1 比赛。3 获胜。1 移至队列末尾。

3 与 2 比赛。3 获胜。他已连续获胜两次。他成为最终获胜者。