def city_day(n, s, a, b):
    if a + b >= n:
        return s.index(min(s)) + 1
    j = a + b + 1
    for i in range(n + 1):
        # print(i, i + j, s[i + a], min(s[i : i + j]), s[i : i + j])
        if i + j < 11:
            k = i + j
        else:
            k = 11
        if s[i + a] == min(s[i:k]):
            return i + a + 1


if __name__ == "__main__":
    n, r, t = list(map(int, input().split()))
    v = list(map(int, input().split()))
    print(city_day(n, v, r, t))