# UUID: 0726901d-fa91-48df-999f-c5987f51c588
def solve():
    n, k = map(int, input().split())
    heights = input().split()

    for i in range(n):
        taller_found = False
        for j in range(max(0, i - k), min(n, i + k + 1)):
            if i != j and abs(i - j) <= k and int(heights[j]) > int(heights[i]):
                taller_found = True
                break
        if not taller_found:
            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)
"""