#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 3;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, x, y;
  cin >> n >> x >> y;
  int counterl, counterr;
  vector<long long> v(n + 1);
  for (long long i = 1; i <= (n); ++i) cin >> v[i];
  long long i = n;
  long long ans = n;
  long long ans2 = INF;
  for (i = x + 1; i <= n; i++) {
    counterl = 1;
    counterr = 1;
    for (long long m = i - 1; m >= (i - x); m--) {
      if (v[m] <= v[i]) {
        counterl = 0;
        break;
      }
    }
    if (counterl == 1) ans = i;
    if (y == 0) {
      cout << ans << '\n';
      return 0;
    }
    if (counterl == 1 && (i + y) <= n) {
      for (long long m = i + 1; m <= (i + y); m++) {
        if (v[m] <= v[i]) {
          counterr = 0;
          break;
        }
      }
      if (counterr == 1) {
        if (i < ans2) {
          ans2 = i;
        }
      }
    }
  }
  cout << min(ans, ans2) << '\n';
  return 0;
}
