#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 10;
int n, x, y, a[M];
int main() {
  int f1, f2;
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    int j = i - 1, k = i + 1;
    f1 = 1;
    f2 = 1;
    while (j >= 0 && j >= i - x) {
      if (a[j] > a[i])
        f1 = 1;
      else {
        f1 = 0;
        break;
      }
      j--;
    }
    while (k < n && k <= i + y) {
      if (a[k] > a[i])
        f2 = 1;
      else {
        f2 = 0;
        break;
      }
      k++;
    }
    if (f1 && f2) {
      cout << i + 1;
      break;
    }
  }
  return 0;
}
