//TLE
#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<tuple>
#include<cmath>
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=998244353;




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

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

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

        vector<ll> tmp=f(f,idx+1,n);
        set<ll> tmpst; //被りがでないように
        for(ll v:tmp){
            for(ll a:A){
                tmpst.insert(v);

                if(v+a<=M){
                    tmpst.insert(v+a);
                }
            }
        }

        
        vector<ll> res;
        for(ll v:tmpst){ //ソートされてる
            res.push_back(v);
            //res.insert(v);
        }

        return res;
    };

    vector<ll> res1=dfs(dfs,0,K/2);
    vector<ll> res2=dfs(dfs,0,K-K/2);

    ll ans=0;

    for(ll v:res1){

        auto it=upper_bound(res2.begin(),res2.end(), M-v);
        if(it==res2.begin()) continue;

        it--;
        ans=max(ans,*it+v);
    }
    /*
    for(ll v:res1){
        if(v+res2.back()<=M){
            ans=max(ans,res2.back()+v);
        }
    }

    for(ll v:res2){
        if(v+res1.back()<=M){ 
            ans=max(ans,res1.back()+v);
        }
    }
    */

   

    cout<<ans<<endl;

   
   


}