#include <bits/stdc++.h>
using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf;
template <class T>
void read(T &x) {
  x = 0;
  int c = getchar();
  int flag = 0;
  while (c < '0' || c > '9') flag |= (c == '-'), c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  if (flag) x = -x;
}
template <class T>
T _max(T a, T b) {
  return b < a ? a : b;
}
template <class T>
T _min(T a, T b) {
  return a < b ? a : b;
}
template <class T>
bool checkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
bool checkmin(T &a, T b) {
  return b < a ? a = b, 1 : 0;
}
const int N = 100005;
int n, k;
long long a[N], b[N], A;
void init() {
  read(n);
  read(k);
  read(A);
  for (int i = 1; i <= n; ++i) read(a[i]), b[i] = a[i];
  sort(b + 1, b + n, greater<int>());
}
void solve() {
  long long sum = 0;
  for (int i = 1; i < k; ++i) sum += b[i];
  int lim = b[k];
  for (int i = 1; i <= n; ++i) {
    if (a[i] < lim) {
      if (a[i] + sum > A) {
        printf("%d\n", i);
        return;
      }
    } else {
      if (sum + lim > A) {
        printf("%d\n", i);
        return;
      }
    }
  }
  printf("%d\n", n);
}
int main() {
  init();
  solve();
  return 0;
}
