#include <bits/stdc++.h>
#define ll long long


using namespace std;

const int inf = 0x3f3f3f3f;

const int maxn = 1e7 + 5;
int prime[maxn];
int isprime[maxn];
int tot = 0;
unordered_map<int, bool> mp;

ll mod = 1e9 + 7;

ll fun(ll res, ll k) { return 0; }

int getDigitSum(int x) {
    int res = 0;
    while (x) {
        res += x % 10;
        x /= 10;
    }
    return res;
}

void getPrime() {
    for (int i = 2; i < maxn; i++) {
        if (!isprime[i]) {
            prime[tot++] = i;
            mp[i] = true;
        }
        for (int j = 0; j < tot && i * prime[j] < maxn; j++) {
            isprime[i * prime[j]] = 1;
            if (i % prime[j] == 0)
                break;
        }
    }
}

bool cmp(pair<int, int> &a, pair<int, int> &b) {
    if (a.first == b.first)
        return a.second < b.second;
    return a.first < b.first;
}

bool strMax(string a, string b) {
    if (a.length() > b.length())
        return true;
    if (a.length() < b.length())
        return false;
    int m = a.length();
    for (int i = 0; i < m; i++) {
        if (a[i] > b[i])
            return true;
        if (a[i] < b[i])
            return false;
    }
    return true;
}

bool cmpStr(string &a, string &b) {
    if (strMax(a, b))
        return true;
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    /***
    int n;
    cin >> n;
    vector<int> b(n);
    vector<pair<int, int>> a(n);
    for(int i = 0; i < n; i ++){
        int x;
        cin >> x;
        b[i] = x;
        a[i] = make_pair(x, i);
    }
    sort(a.begin(), a.end(), cmp);
    //for(int i = 0; i < n; i ++) cout << a[i].first << " " << a[i].second << "\n";
    int ans = 0;
    int change = 0;
    priority_queue<int, vector<int>, greater<int>> heap;
    for(int i = 0; i < n; i ++){
            cout << change << "\n";
        while(!heap.empty() && heap.top() < i){
            heap.pop();
            change --;
        }
        //cout << a[i].second + change << " " << i << '\n';
        if(a[i].second + change > i){
            //cout << a[i].second + change << " " << i << '\n';
            //cout << "\n";
            ans += a[i].second + change - i;
            heap.push(a[i].second + change);
            change ++;
        }
    }
    cout << ans << "\n";
    ***/
    ll n, k, y;
    cin >> n >> k >> y;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a.rbegin(), a.rend());
    if (a[0] < 0 && a[0] < y) {
        cout << "No\n";
    } else {
        bool ok = false;
        ll res = 0;
        for (int i = 0; i < k; i++) {
            if (res >= y) {
                ok = true;
                break;
            }
            res += a[i];
        }
        if (res >= y)
            ok = true;
        if (ok)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    return 0;
}