#include <bits/stdc++.h>
long long mod = 1000000007;
using namespace std;
long long pa[500008];
long long sz[500008];
long long find(long long x) {
  if (pa[x] == x) return x;
  return pa[x] = find(pa[x]);
}
void unioni(long long x, long long y) {
  long long px = find(x), py = find(y);
  if (px == py) return;
  pa[px] = py;
  sz[py] = sz[px] + sz[py];
}
long long INF = 10000000000000000;
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) {
      res = res * x;
      res = res % 998244353;
    }
    y = y >> 1;
    x = x * x;
    x = x % 998244353;
  }
  return res;
}
int main() {
  long long n, i, j, k, l, m, x, y, mn, ele, f = 0;
  cin >> n >> x >> y;
  vector<long long> a(n);
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < n; i++) {
    f = 1;
    for (j = 1; j <= y; j++) {
      if (i + j >= n) {
        break;
      }
      if (a[i + j] <= a[i]) {
        f = 0;
        break;
      }
    }
    if (f == 1) {
      for (j = 1; j <= x; j++) {
        if (i - j < 0) {
          break;
        }
        if (a[i - j] <= a[i]) {
          f = 0;
          break;
        }
      }
    }
    if (f == 1) {
      cout << i + 1;
      return 0;
    }
  }
  return 0;
}
