#include <bits/stdc++.h>
const int N = 1e5 + 100;
const int M = 1e5 + 100;
const double EPS = 1e-9;
using namespace std;
int n, x, y;
int a[N];
int main() {
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) {
    int jud = 1;
    for (int j = max(1, i - x); j <= min(n, i + y); j++) {
      if (j == i)
        continue;
      else if (a[j] <= a[i]) {
        jud = 0;
        break;
      }
    }
    if (jud) {
      printf("%d\n", i);
      return 0;
    }
  }
  return 0;
}
