#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, k, x, y;
int a[maxn];
int main() {
  while (~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++) {
      bool fa = 1;
      for (int j = max(1, i - x); j < i; j++) {
        if (a[j] < a[i]) {
          fa = 0;
          break;
        }
      }
      if (fa == 0) continue;
      for (int j = i + 1; j <= min(n, i + y); j++) {
        if (a[j] < a[i]) {
          fa = 0;
          break;
        }
      }
      if (fa == 0) continue;
      printf("%d\n", i);
      break;
    }
  }
  return 0;
}
