#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const int OO = 0x3f3f3f3f, N = 2e5 + 7;
int a[N];
int n, x, y;
int main() {
  cin >> n >> x >> y;
  unordered_map<int, int> idx;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    idx[a[i]] = i;
  }
  int ans = -1;
  for (int i = x; i < n; ++i) {
    int c1 = 0, c2 = 0;
    for (int j = i - x; j < i; ++j) {
      if (a[j] > a[i]) {
        c1++;
      }
    }
    for (int j = i + 1; j <= i + y && j < n; ++j) {
      if (a[j] > a[i]) {
        c2++;
      }
    }
    if (c1 == x && c2 == y) {
      ans = i + 1;
      break;
    }
  }
  if (~ans) {
    cout << ans;
  } else {
    cout << n;
  }
}
