#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,K;
long M;
int A[100];
vector<long>f(int k)
{
	vector<long>ret;
	if(k>=0)ret.push_back(0L);
	if(k>=1)
	{
		for(int i=0;i<N;i++)ret.push_back(A[i]);
	}
	if(k>=2)
	{
		for(int i=0;i<N;i++)for(int j=0;j<N;j++)ret.push_back(A[i]+A[j]);
	}
	if(k>=3)
	{
		for(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int l=0;l<N;l++)
		{
			ret.push_back((long)A[i]+A[j]+A[l]);
		}
	}
	sort(ret.begin(),ret.end());
	ret.erase(unique(ret.begin(),ret.end()),ret.end());
	return ret;
}
int main()
{
	cin>>N>>M>>K;
	for(int i=0;i<N;i++)cin>>A[i];
	vector<long>F=f(K/2),G=f(K-K/2);
	long ans=0;
	int j=G.size()-1;
	for(int i=0;i<F.size();i++)if(F[i]<=M)
	{
		while(F[i]+G[j]>M)j--;
		ans=max(ans,F[i]+G[j]);
	}
	cout<<ans<<endl;
}