#include <bits/stdc++.h>
const int minINF = 1e5;
const int INF = 1e9;
const long long INFL = 1e18;
const int MAX = 1e5 + 100;
bool prime(int n) {
  if (n <= 1) return false;
  if (n == 2) return true;
  for (int x = 2; x * x <= n; x++) {
    if (n % x == 0) return false;
  }
  return true;
}
using namespace std;
int idir[] = {-1, 0, 1, 0};
int jdir[] = {0, 1, 0, -1};
vector<int> graph[205];
bool visited[205];
void changit(string& s) {
  for (int i = 0; i < s.length(); i++) {
    if (isalpha(s[i]) and isupper(s[i])) {
      s[i] = tolower(s[i]);
    }
  }
}
int main() {
  int n, x, y;
  cin >> n >> x >> y;
  int a[MAX];
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    bool befor = true, after = true;
    for (int j = i - x; j < i; j++) {
      if (j <= 0)
        continue;
      else if (a[i] >= a[j]) {
        befor = false;
        break;
      }
    }
    if (befor) {
      for (int j = i + 1; j <= i + y; j++) {
        if (j > n)
          continue;
        else if (a[i] >= a[j]) {
          after = false;
          break;
        }
      }
      if (after) {
        cout << i << endl;
        break;
      } else
        continue;
    } else
      continue;
  }
}
