#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
using namespace std;
int pre[1000002];
int main() {
  int n, x, y, k;
  vector<int> v;
  cin >> n >> x >> y;
  int m = INT_MAX;
  for (int i = 0; i < n; i++) {
    cin >> k;
    v.push_back(k);
    m = min(m, k);
    pre[i] = m;
  }
  for (int i = 0; i < n; i++) {
    int p = i - 1;
    int q = i + y;
    if (i == 0) p = 0;
    if (q >= n) q = n - 1;
    if (v[i] <= pre[p] && v[i] <= pre[q]) {
      cout << i + 1 << endl;
      break;
    }
  }
  return 0;
}
