#pragma GCC optimize("Ofast") #include using namespace std; typedef long long int ll; typedef unsigned long long ull; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll myRand(ll B) { return (ull)rng() % B; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int n,m,x,y; cin >> n >> m >> x >> y; vector a(n); int cnt=0; for(int i=0;i> a[i]; if(a[i]>=x)cnt++; } sort(a.rbegin(), a.rend()); if(cnt>m){ printf("Handicapped\n"); } else{ ll res=0; for(int i=0;iy)res+=a[i]; } printf("%lld\n",res); } }