不会的看我！！！！！

#include <bits/stdc++.h>
using namespace std;
queue<int>q;
long long n,k;
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;++i) 
    {
        int t;
        cin>>t;
        q.push(t);
    }
    long long sum = q.front();
    q.pop();
    int cnt = 1;
    while(cnt<=k)
    {
        if(sum>q.front())
        {
            cnt++;
            q.push(q.front());
            q.pop();
        }
        else if((sum<q.front()))
        {
            cnt = 0;
            q.push(sum);
            sum = q.front();
            q.pop();
            
        }
        
        
    }
    cout<<sum<<endl;
    return 0;
}