#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;
  vector<long long> v(n + 1);
  for (long long i = 1; i <= (n); ++i) cin >> v[i];
  int counter = 1;
  if (x == 0) {
    if (y == 0) {
      cout << 1 << '\n';
      return 0;
    } else {
      for (long long i = 1; i <= (n); ++i) {
        int i2 = i + 1;
        while (i2 <= min(i + y, n)) {
          counter = 1;
          if (v[i2] <= v[i]) {
            counter = 0;
            break;
          }
          i2++;
        }
        if (counter == 1) {
          cout << i << '\n';
          return 0;
        }
      }
    }
  }
  for (long long i = 1; i <= (n); ++i) {
    counter = 1;
    int i1 = i - 1, i2 = i + 1;
    while (i1 >= max(i - x, 1ll)) {
      if (v[i1] <= v[i]) {
        counter = 0;
        break;
      }
      i1--;
    }
    while (i2 <= min((i + y), n)) {
      if (v[i2] <= v[i]) {
        counter = 0;
        break;
      }
      i2++;
    }
    if (counter == 1) {
      cout << i << '\n';
      return 0;
    }
  }
  cout << n << '\n';
  return 0;
}
