#include <bits/stdc++.h>
using namespace std;
long long a[1000000 + 9];
int main() {
  int n, x, y, flag;
  int i, j;
  cin >> n >> x >> y;
  for (i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (i = 1; i <= n; i++) {
    flag = 1;
    for (j = 1; j <= x; j++)
      if (a[i - j] >= 1)
        if (a[i - j] <= a[i]) flag = 0;
    for (j = 1; j <= y; j++)
      if (a[i + j] <= n)
        if (a[i + j] <= a[i]) flag = 0;
    if (flag) {
      cout << i << endl;
      return 0;
    }
  }
}
