#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 ans = -1;
    for (int i = 0; i < n; i++)
    {
        int end = min(n, i + k + 1);
        int max = vals[i];
        int maxIndex = i;
        for (int j = i + 1; j < end; j++)
        {
            if (max < vals[j])
            {
                max = vals[j];
                maxIndex = j;
            }
        }
        if (i == maxIndex)
        {
            ans = i + 1;
            break;
        }
        i = maxIndex - 1;
    }
    cout << ans;
    return 0;
}