#include <iostream>
//#include <fstream>
#include <vector>
#include <climits>
#define ll long long

using namespace std;

//ifstream cin("fasor.in");
//ofstream cout("fasor.out");

vector <ll>x;

ll n,k,i,j,a,maxi=LONG_MIN,maxi2=LONG_MIN,pos,pos2;

int main()
{
    cin>>n>>k;
    for(i=1;i<=n;++i)
    {
        cin>>a;
        x.push_back(a);
    }

    for(i=0;i<=k;++i)
        if(x[i]>maxi)
        {
            maxi=x[i];
            pos=i;
        }
    if(maxi==x[n-1]) cout<<pos+1;
    else
    {
        if((pos+k)<n)
    {
        for(i=(pos+1);i<=(pos+k);++i)
        if(x[i]>maxi2)
        {
            maxi2=x[i];
            pos2=i;
        }
    }
    else
    {
        for(i=(pos+1);i<n;++i)
        if(x[i]>maxi2)
        {
            maxi2=x[i];
            pos2=i;
        }
    }
    if(maxi>=maxi2) cout<<pos+1;
        else
        {
            while(maxi<maxi2)
            {
                pos=pos2;
                maxi=maxi2;
                if((pos+k)<n)
                {
                    for(i=(pos+1);i<=(pos+k);++i)
                    if(x[i]>maxi2)
                    {
                        maxi2=x[i];
                        pos2=i;
                    }
                }
                else
                {
                    for(i=(pos+1);i<n;++i)
                    if(x[i]>maxi2)
                    {
                        maxi2=x[i];
                        pos2=i;
                    }
                }

            }
            cout<<pos+1;
        }
    }
    return 0;
}