#ifdef ONLINE_JUDGE #pragma GCC optimize(2, "Ofast", "inline") #endif #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define rt return #define pi pair<int, int> #define pl pair<ll, ll> #define pu pair<ull, ull> #define int long long #define ll long long #define ull unsigned long long #define endl '\n' #define Endl endl #define all(x) x.begin(), x.end() #define all1(x) next(x.begin()), x.end() #define lll __int128_t #define ulll __uint128_t using namespace std; const int64_t maxn = 1e5; const int64_t mod = 998244353; const int64_t maxl = (int64_t)(1e18); const int64_t maxi = 1e9 + 7; void init() { } void solve() { int n, k, y; cin >> n >> k >> y; assert(1 <= n && 1 <= k && maxn >= n && maxn >= k && n >= k && y <= maxl && y >= -maxl); vector<int> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; assert(a[i] >= -maxl && a[i] <= maxl); } sort(all1(a), greater<int>()); lll ans = 0; for (int i = 1; i <= k; i++) { if (a[i] > 0) ans += a[i]; } if (ans >= y) { cout << "Yes" << endl; } else cout << "No" << endl; } signed main() { #ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin); freopen("2.txt", "w", stdout); #endif std::ios::sync_with_stdio(0); std::cin.tie(0); int __ = 1; // std::cin >> __; init(); while (__--) { solve(); // cerr<<"TIME"<<qq-__<<endl; } return 0; }