B. 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.

Input

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 a1, a2, …, an (1 ≤ ai ≤ n) — powers of the player. It’s guaranteed that this line contains a valid permutation, i.e. all ai are distinct.

Output

Output a single integer — power of the winner.

Examples

Input
2 2
1 2
Output
2
Input
4 2
3 1 2 4
Output
3
Input
6 2
6 5 3 1 2 4
Output
6
Input
2 10000000000
2 1
Output
2

Note
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.

在做本题的时候我没有注意到的一点就是当下一个数大于前一个数的时候，也算赢了一次，所以这个也要算一次，这个不要忘记。

#include"stdio.h"
int main()
{
	int n,a[550],x;
	long long m;
	while(~scanf("%d %lld",&n,&m))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		int flag =0;
		x=0;
		for(int i=0;i<n;)
		{
			for(int j=i+1;j<i+1+m;j++)
			{	
				if(a[i]>a[j])
				{
					x++;
				}
				else if(a[i]<a[j])
				{
					i=j;
					x = 1;
					break;
				}
				if(x==m)
		    	{
					break;
				} 
			}
			if(x==m)
			{
			    printf("%d\n",a[i]);
				flag = 1; 
				break;
			}
		}
		if(flag == 0)
		{
	    	printf("%d\n",n);
		}
	}
	return 0;
}