#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
const int N = 5 * (1e6);
const int MAX = 7 * (1e7);
const int MOD = (1e9) + 1;
const long long INF = (1e17) + 789;
const long double pi = 4 * atan(1);
int a[100010];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  int n, first, second;
  cin >> n >> first >> second;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    bool ok = true;
    for (int j = max(1, i - first); j < i; j++) {
      if (a[j] < a[i]) {
        ok = false;
        break;
      }
    }
    for (int k = i + 1; k <= min(i + second, n); k++) {
      if (a[k] < a[i]) {
        ok = false;
        break;
      }
    }
    if (ok) cout << i, exit(false);
  }
  return false;
}
