#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 50;
int a[maxn];
int main() {
  int n, x, y;
  scanf("%d %d %d", &n, &x, &y);
  for (long long i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    long long tmp = i, j;
    for (j = max(i - x, 1); j <= i - 1; j++) {
      if (a[j] < a[tmp]) break;
    }
    if (j <= i - 1) continue;
    for (j = i + 1; j <= min(i + y, n); j++) {
      if (a[j] < a[tmp]) break;
    }
    if (j <= min(i + y, n))
      continue;
    else {
      ans = i;
      break;
    }
  }
  printf("%lld\n", ans);
}
