import java.util.*;

public class CityDay {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int x = sc.nextInt();
		int y = sc.nextInt();
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = sc.nextInt();
		}

		if (x == arr.length) {
			System.out.println(arr.length);
		} else {

			for (int i = x; i < arr.length; i++) {
				int min1 = Integer.MAX_VALUE;
				int min2 = Integer.MAX_VALUE;
				for (int j = i - 1; j >= i - x; j--) {
					if (j < 0 || j >= arr.length) {
						break;
					}
					if (min1 > arr[j]) {
						min1 = arr[j];
					}

				}
				for (int j = i + 1; j <= i + y; j++) {
					if (j < 0 || j >= arr.length) {
						break;
					}
					if (min2 > arr[j]) {
						min2 = arr[j];
					}
				}
				if (arr[i] < min1 && arr[i] < min2) {
					System.out.println(i + 1);
					break;
				}
			}
		}

	}

}