# UUID: 3d8b3cf5-1797-4912-b05a-906a4fb0f6cc
from collections import deque
import sys

def solve():
    n, k = map(int, sys.stdin.readline().split())
    heights_str = sys.stdin.readline().split()

    def get_heights():
        for s in heights_str:
            yield int(s)

    heights_iter = get_heights()
    heights_list = []
    for h in heights_iter:
        heights_list.append(h)

    n = len(heights_list)
    if n == 0:
        return

    can_sit = [True] * n

    # Left pass: Find tallest tree to the left within k distance
    left_deque = deque()
    for i in range(n):
        while left_deque and left_deque[0] < i - k:
            left_deque.popleft()
        while left_deque and heights_list[left_deque[-1]] <= heights_list[i]:
            left_deque.pop()
        left_deque.append(i)
        if left_deque[0] != i and heights_list[left_deque[0]] > heights_list[i]:
            can_sit[i] = False

    # Right pass: Find tallest tree to the right within k distance
    right_deque = deque()
    for i in range(n - 1, -1, -1):
        while right_deque and right_deque[0] > i + k:
            right_deque.popleft()
        while right_deque and heights_list[right_deque[-1]] <= heights_list[i]:
            right_deque.pop()
        right_deque.append(i)
        if right_deque[0] != i and heights_list[right_deque[0]] > heights_list[i]:
            can_sit[i] = False

    for i in range(n):
        if can_sit[i]:
            print(i + 1)
            return


if __name__ == "__main__":
    solve()
"""    
N,K=[int(x) for x in input().split()]
A= input().split()

res=0
done = False
while not done:
    for i in range(1,K+1):
        if res+i<N:
            if int(A[res])<int(A[res+i]):
                res+=i
                i=-1
                break
        else:
            done=True
            break
    if i==K:
        done=True

print(res+1)
"""