#include <bits/stdc++.h>
using namespace std;
long long a[100000 + 10];
long long x[100000 + 10];
int main() {
  long long n, p, q;
  cin >> n >> p >> q;
  for (long long i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  a[0] = a[n + 1] = 1000000007;
  x[n + 1] = 1000000007;
  for (long long i = n; i >= 1; i--)
    if (a[i] < a[i + 1])
      x[i] = x[i + 1] + 1;
    else
      x[i] = 0;
  long long cur = 1000000007;
  for (long long i = 1; i <= n; i++) {
    if (a[i - 1] > a[i])
      cur++;
    else
      cur = 0;
    if (cur >= p && x[i] >= q) {
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}
