#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int mn, pos = 1, n, x, y, A[N];
int main() {
  cin >> n >> x >> y;
  for (int i = 1; i <= n; i++) cin >> A[i];
  mn = A[1];
  if (n == 1 || y == 0) {
    cout << "1"
         << "\n";
    return 0;
  }
  for (int i = 2; i <= n; i++) {
    while (mn < A[i]) {
      if (i - pos == y || i == n) {
        cout << pos << "\n";
        return 0;
      }
      i++;
    }
    mn = A[i];
    pos = i;
    if (i == n) cout << n << "\n";
  }
  return 0;
}
