#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 1;
const int M = 1e5 + 1;
const int INF = 1e9 + 5;
const int base = 1e4;
const long long mod = 1e9 + 7;
int n, x, y, a[N];
int main() {
  cin >> n >> x >> y;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    bool us = 0;
    for (int j = max(i - x, 1); j < i; j++) {
      if (a[i] > a[j]) {
        us = 1;
        break;
      }
    }
    for (int j = i + 1; j <= min(i + y, n); j++) {
      if (a[i] > a[j]) {
        us = 1;
        break;
      }
    }
    if (!us) {
      cout << i;
      return 0;
    }
  }
}
