#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
set<pair<int, int> > st;
vector<int> v;
set<pair<int, int> >::iterator P;
long long A[200001], n, m, i, j, t, k, x, y;
string s, s1;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cin >> n >> x >> y;
  for (i = 0; i < n; i++) cin >> A[i];
  for (i = 0; i < n; i++) {
    t = i + 1;
    for (j = max(i - x, (long long)0); j < min(i + y + 1, n); j++)
      if (A[i] > A[j]) {
        t = 0;
        break;
      }
    if (t != 0) break;
  }
  cout << t;
  return 0;
}
