import sys
import math
from collections import deque


def scan():
    return list(map(int, sys.stdin.readline().strip().split()))


def print_primes_till_n(n):
    i, j, flag = 0, 0, 0
    a = []
    c = 0
    for i in range(1, n + 1, 1):
        if i == 1 or i == 0:
            continue
        flag = 1
        for j in range(2, ((i // 2) + 1), 1):
            if i % j == 0:
                flag = 0
                break
        if flag == 1:
            a.append(i)
            c += 1
    return a, c


def is_square(n):
    b = math.sqrt(n)
    if n == int(b * b):
        return True
    return False


def solution():
    # for _ in range(int(input())):
    n, x, y = scan()
    a = scan()
    for i in range(x-1, n):
        b = a[i-x:i]
        c = a[i+1:1+i+y]
        # print(b, a[i], c)
        d = 0
        e = 0
        for j in b:
            if a[i] < j:
                d += 1
        for j in c:
            if a[i] < j:
                e += 1
        if e == len(c) and d == len(b):
            print(i+1)
            break


if __name__ == '__main__':
    solution()
