#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
	// input
	int N,K; ll M;
	cin >> N >> M >> K; 
	vector<ll> A(N+1);
	for(int i = 0; i < N; i++) cin >> A[i];
	// prep
	vector<set<ll>> S(3);
	for(int i = 0; i <= N; i++){
		S[0].insert(A[i]);
		for(int j = 0; j <= N; j++){
			S[1].insert(A[i]+A[j]);
			for(int k = 0; k <= N; k++) S[2].insert(A[i]+A[j]+A[k]);
		}
	}
	// solve
	ll ans = 0; K--;
	if(K < 3) ans = *S[K].lower_bound(M);
	else {
		for (auto idx : S[2]){
			auto it = S[K%3].lower_bound(M-idx);
			ll tmp = idx + *it;
			if(tmp <= M) ans = max(ans,tmp);
		}
	}
	cout << ans << endl;
}