#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
	int N,K; ll M; cin >> N >> M >> K;
	vector<ll> A(N);
	for (int i = 0; i < N; i++) cin >> A[i];
	
	A.push_back(0);
	sort(A.begin(),A.end());
	
	ll scr = 0;
	while(K--){
		auto it = upper_bound(A.begin(),A.end(),M-scr); it--;
		scr += *it;
	}
	cout << scr << endl;
}