#include <bits/stdc++.h>
using namespace std;
int F(long long int a[], long long int n) {
  int incl = a[0];
  int excl = 0;
  int excl_new;
  for (int i = 1; i < n; i++) {
    excl_new = (incl > excl) ? incl : excl;
    incl = excl + a[i];
    excl = excl_new;
  }
  return ((incl > excl) ? incl : excl);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  long long int x, y, pos = 0;
  long long int temp, status = 0;
  cin >> x >> y;
  long long int a[n + y];
  for (int i = n; i < n + y; i++) a[i] = 1000000000;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = x; i <= n; i++) {
    if (*min_element(a + i - x, a + i) > a[i] &&
        *min_element(a + i + 1, a + i + y - 1) > a[i]) {
      status = 1;
      pos = i + 1;
      break;
    }
  }
  if (status) cout << pos << endl;
  return 0;
}
