#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

long long A[100000];

int main() {

    int n, d;
    long long P;
    cin >> n >> P >> d;

    vector<long long> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }

    int L = 1, R = d;
    int res = -1;

    while(L <= R) {
        int days = (L + R) / 2;
        priority_queue<long long> pq, greatest;

        for(int i = 0; i < n; i++) {
            pq.push(v[i]);
        }

        long long sum = 0;

        for(int i = 1; i <= d; i++) {
            long long m = 0;
            if(!pq.empty()) {
                m = pq.top();
                pq.pop();
            }

            sum += m;
            if(i > days) {
                pq.push(greatest.top());
                greatest.pop();
            }
            greatest.push(m);
        }

        if(sum >= P) {
            res = max(res, days);
            L = days + 1;
        }
        else {
            R = days - 1;
        }


    }

    if(res == d) {
        cout << "seedno" << endl;
    }
    else {
        cout << res << endl;
    }


}