#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
int n;
int x, y;
int a[maxn];
int leftttt[maxn], righttt[maxn];
int main() {
  cin >> n >> x >> y;
  for (int i = 0; i < 7; i++) a[i] = INT_MAX;
  for (int i = 7; i < 7 + n; i++) scanf("%d", a + i);
  for (int i = 7 + n; i < 14 + n; i++) a[i] = INT_MAX;
  for (int i = 7; i < 7 + n; i++) {
    int cnt = 0;
    for (int j = i - 1; j >= i - x; j--) {
      if (a[i] < a[j])
        cnt++;
      else
        break;
    }
    leftttt[i] = cnt;
    cnt = 0;
    for (int j = i + 1; j <= i + y; j++) {
      if (a[j] > a[i])
        cnt++;
      else
        break;
    }
    righttt[i] = cnt;
  }
  int ans = -1;
  for (int i = 7; i < 7 + n; i++) {
    if (leftttt[i] >= x && righttt[i] >= y) {
      ans = i + 1 - 7;
      break;
    }
  }
  cout << ans << endl;
  return 0;
}
