#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,ek;
  cin>>n>>m>>ek;
  vector<ll> a(n);
  rep(i,n) cin>>a.at(i);
  sort(a.begin(),a.end());
  ll ans=0;
  for(int i=0;i<n;i++){
    ll tmpi=a.at(i);
    if(tmpi>m) break;
    ans=max(ans,tmpi);
    if(ek<=1) continue;
    for(int j=i;j<n;j++){
      ll tmpj=a.at(i)+a.at(j);
      if(tmpj>m) break;
      ans=max(ans,tmpj);
      if(ek<=2) continue;
      for(int k=j;k<n;k++){
        ll tmpk=a.at(i)+a.at(j)+a.at(k);
        if(tmpk>m) break;
        ans=max(ans,tmpk);
        if(ek<=3) continue;
        for(int l=k;l<n;l++){
          ll tmpl=a.at(i)+a.at(j)+a.at(k)+a.at(l);
          if(tmpl>m) break;
          ans=max(ans,tmpl);
          if(ek<=4) continue;
          for(int o=l;o<n;o++){
            ll tmpo=a.at(i)+a.at(j)+a.at(k)+a.at(l)+a.at(o);
            if(tmpo>m) break;
            ans=max(ans,tmpo);
            if(ek<=5) continue;
            for(int p=o;p<n;p++){
              ll tmpp=a.at(i)+a.at(j)+a.at(k)+a.at(l)+a.at(o)+a.at(p);
              if(tmpp>m) break;
              ans=max(ans,tmpp);
            }
          }
        }
      }
    }
  }
  cout<<ans<<endl;
}