# UUID: df73d4d7-1498-4dd1-b1c0-f87deb92f32a
from collections import deque

def solve():
    n, k = map(int, input().split())
    heights = list(map(int, input().split()))

    for i in range(n):
        can_sit = True

        # Check left side
        left_deque = deque()
        for j in range(max(0, i - k), i):
            while left_deque and heights[left_deque[-1]] <= heights[j]:
                left_deque.pop()
            left_deque.append(j)
        if left_deque and heights[left_deque[0]] > heights[i]:
            can_sit = False

        if not can_sit:
            continue

        # Check right side
        right_deque = deque()
        for j in range(i + 1, min(n, i + k + 1)):
            while right_deque and heights[right_deque[-1]] <= heights[j]:
                right_deque.pop()
            right_deque.append(j)
        if right_deque and heights[right_deque[0]] > heights[i]:
            can_sit = False

        if can_sit:
            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)
"""