#include <iostream>
using namespace std;
int fak[200001]{ 0 };
int main()
{
    long long n, k, h,max=0;
    cin >> n>>k;
    for (int i = 1; i <= n; i++) {
        cin >> h;
        fak[i] = h;
        if (h > max)
            max = h;
    }
    for (int i = 1; i <= n; i++) {
        if(fak[i]>=fak[i-1]){
        int ln = 0;
        for (int y = i; y <= i + k and y<=max; y++) {
            if (fak[y] > fak[i]) {
                ln = 1;
                break;
            }
                
            
        }
        if (ln == 0) {
            for (int y = i; y > i - k and y > 0; y--) {
                if (fak[y] > fak[i]) {
                    ln = 1;
                    break;
                }
            }
        }
        if (ln == 0) {
            cout << i;
            break;
        }
        }
    }

}