#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
const long long int N = 1e5 + 5;
const long long int INF = 1e13;
long long int mod = 998244353;
long long int dx[4] = {0, 0, +1, -1};
long long int dy[4] = {+1, -1, 0, 0};
void solve() {
  long long int n, x, y;
  cin >> n >> x >> y;
  vector<long long int> v(n + 1, -1);
  for (long long int i = 1; i <= n; i++) cin >> v[i];
  for (long long int i = 1; i <= n; i++) {
    long long int f = 0;
    for (long long int j = i - 1; j >= max(i - x, (long long int)1); j--) {
      if (v[j] < v[i] and v[j] != -1) {
        f = 1;
        break;
      }
    }
    for (long long int j = i + 1; j <= min(n, i + y); j++) {
      if (v[j] < v[i] and v[j] != -1) {
        f = 1;
        break;
      }
    }
    if (f == 0) {
      cout << i << "\n";
      return;
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) solve();
  return 0;
}
