#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;

    cin >> n >> k;
    vector<int> vals(n);
    for (int i = 0; i < n; i++)
    {
        cin >> vals[i];
    }
    int s = k - 1;
    int e = n - k + 1;
    int le = n - k + 1;
    while (true)
    {
        int max = 0;
        int save = -1;
        if (e <= s)
        {
            break;
        }
        for (int i = s; i < e; i++)
        {
            if (vals[i] > max)
            {
                max = vals[i];
                save = i;
            }
        }
        le = e;
        e = save - k + 3;
    }
    cout << le + 1;
    return 0;
}