#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll M,K;
ll A[110];
ll ret;
set<ll> S;
void go(ll v) {
	if(v<=M) {
		auto it=S.lower_bound(M-v+1);
		if(it!=S.begin()) ret=max(ret,v+*--it);
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K;
	FOR(i,N) cin>>A[i];
	
	for(int L=N-1;L>=0;L--) {
		for(x=L;x<N;x++) for(y=x;y<N;y++) S.insert(A[L]+A[x]+A[y]);
		if(K>=4) go(A[L]);
		FOR(y,L+1) {
			if(K>=5) go(A[L]+A[y]);
			FOR(x,y+1) if(K>=6) go(A[L]+A[y]+A[x]);
		}
	}
	
	FOR(i,N) if(A[i]<=M) ret=max(ret,A[i]);
	if(K>=2) FOR(i,N) FOR(j,N) if(A[i]+A[j]<=M) ret=max(ret,A[i]+A[j]);
	if(K>=3) go(0);
	
	cout<<ret<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}