#include <bits/stdc++.h>
using namespace std;
inline long long get_num(char ch) {
  if (ch == '-')
    return 0;
  else if (ch >= 'a' && ch <= 'z') {
    return 1 + (ch - 'a');
  } else if (ch >= 'A' && ch <= 'Z') {
    return 27 + (ch - 'A');
  } else if (ch >= '0' && ch <= '9') {
    return 53 + (ch - '0');
  }
}
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
inline int GA(long long n, vector<long long>& vec) {
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    vec.push_back(x);
  }
  return 0;
}
inline int GAEG(long long m, vector<long long> vec[]) {
  for (long long i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    x--, y--;
    vec[x].push_back(y);
    vec[y].push_back(x);
  }
  return 0;
}
const long long MD = 998244353;
long long pw(long long x, long long y) {
  if (y == 0) return 1;
  long long o = y / 2;
  long long f = pw(x, o) % MD;
  if (y % 2) {
    return (f * f * x) % MD;
  } else
    return (f * f) % MD;
}
vector<long long> v;
int main() {
  long long n, oo, tt;
  cin >> n >> oo >> tt;
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    v.push_back(x);
  }
  long long ans = 0;
  for (long long i = 0; i < n; ++i) {
    bool bl = false;
    long long x = v[i];
    long long j = i - 1;
    while (j >= 0 && i - oo <= j) {
      if (v[j] <= v[i]) {
        bl = true;
        break;
      }
      j--;
    }
    j = i + 1;
    while (j < v.size() && i + tt >= j) {
      if (v[j] <= v[i]) {
        bl = true;
        break;
      }
      j++;
    }
    if (!bl) {
      ans = i + 1;
      break;
    }
  }
  cout << ans << endl;
  return 0;
}
