#include <bits/stdc++.h>
using namespace std;
vector<int> RainFall;
vector<int> RainFallCopy;
pair<int, int> RainCopy[10000];
bool compare(pair<int, int> a, pair<int, int> b) { return a.first < a.first; }
int Sort0(int x, int y, int j, int n) {
  int x0 = j - x, y0 = j + y;
  if (x0 < 0) x0 = 0;
  if (y0 > (n - 1)) y0 = (n - 1);
  RainFallCopy = RainFall;
  sort(RainFallCopy.begin() + x0, RainFallCopy.begin() + y0 + 1);
  if (RainFallCopy[x0] == RainFall[j]) {
    cout << j + 1;
    return 1;
  }
}
void MyFunction() {
  int n = 0, x = 0, y = 0;
  cin >> n >> x >> y;
  int RainFall0 = 0;
  for (int i = 0; i < n; i++) {
    cin >> RainFall0;
    RainFall.push_back(RainFall0);
    RainCopy[i].first = RainFall0;
    RainCopy[i].second = i;
  }
  sort(RainCopy, RainCopy + n, compare);
  for (int j = 0; j < n; j++) {
    if (Sort0(x, y, RainCopy[j].second, n) == 1) {
      break;
    }
  }
}
int main() {
  MyFunction();
  return 0;
}
