#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(int)(n);i++)

int main(){
  ll n,m,k;
  cin>>n>>m>>k;
  vector<ll> a(n);
  rep(i,n) cin>>a[i];
  a.push_back(0);
  sort(a.begin(),a.end());
  set<ll> st={0},st2={0};
  ll near_ans=0;
  int dv=k/2;
  rep(i,dv){
    set<ll> st3;
    for(ll x:st){
      for(ll y:a){
        if(x+y>m) break;
        st3.insert(x+y);
      }
    }
    swap(st,st3);
  }
  rep(i,k-dv){
    set<ll> st3;
    for(ll x:st2){
      for(ll y:a){
        if(x+y>m) break;
        st3.insert(x+y);
      }
    }
    swap(st2,st3);
  }
  ll ans=0;
  for(ll x:st2){
    ll df=m-x;
    ll y=*st.lower_bound(df);
    if(x+y>m) continue;
    ans=max(ans,x+y);
  }
  cout<<ans<<endl;
}