# your code goes here

import sys
# your code goes here
n,x,y=map(int,raw_input().split())
m=map(int,raw_input().split())
for j in range(x,n-y+1): 
    a=m[j-x:j+1] 
    b=m[j:j+y+1]

    if min(a)==a[-1] and min(b)==b[0] : 
        print j+1
        break
