#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

int main(){
    int N,M,K;
    cin>>N>>M>>K;
    vector<ll> A(N);
    for(int i=0;i<N;i++)cin>>A[i];

    auto dfs=[&](auto f,int idx,int goalidx)->vector<ll>{

        if(idx==goalidx){
            vector<ll>res={0};
            return res;
        }

        auto tmpres=f(f,idx+1,goalidx);

        vector<ll> res=tmpres;

        for(ll v:tmpres){
            for(int i=0;i<N;i++){
                if(v+A[i]<=M){
                    res.push_back(v+A[i]);
                }
            }
        }

        return res;


    };

    int halfK=K/2;
    auto res1=dfs(dfs,0,halfK);
    auto res2=dfs(dfs,halfK,K);

    sort(res1.begin(),res1.end());
    sort(res2.begin(),res2.end());

    ll ans=0;

    for(ll v:res1){ 
        auto it=upper_bound(res2.begin(),res2.end(), M-v);

        if(it!=res2.begin()){
            it--;
            ll val=(*it + v);
            ans=max(ans,val);
        }
    }

    cout<<ans<<endl;
}