#include <bits/stdc++.h>
using namespace std;
long long a[100005], b[100005];
const long long INF = 1000000009;
int main() {
  int n, x, y;
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) b[i] = INF;
  for (int i = 0; i < n; i++)
    for (int j = i - y; j <= i + x && j < n; j++)
      if (j >= 0 && j != i) b[j] = min(a[i], b[j]);
  int k = 0;
  while (b[k] < a[k]) k++;
  cout << k + 1;
  return 0;
}
