#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <random>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n,m,K;
  cin>>n>>m>>K;
  vector<int>a(n);
  cin>>a;
  a.push_back(0);
  n++;
  if(K==1){
    int ans=0;
    for(auto i:a)if(i<=m)chmax(ans,i);
    cout<<ans<<endl;
  }
  else if(K==2){
    int ans=0;
    for(auto i:a)for(auto j:a)if(i+j<=m)chmax(ans,i+j);
    cout<<ans<<endl;
  }
  else if(K==3){
    int ans=0;
    for(auto i:a)for(auto j:a)for(auto k:a)if(i+j+k<=m)chmax(ans,i+j+k);
    cout<<ans<<endl;
  }
  else{
    vector<int>b;
    for(auto i:a)for(auto j:a)b.push_back(i+j);
    vector<int>c;
    for(auto i:a)for(auto j:a)for(auto k:a)c.push_back(i+j+k);
    sort(all(b)),sort(all(c));
    int ans=0;
    if(K==4){
      for(auto i:b){
        int cu=upper_bound(all(b),m-i)-b.begin();
        cu--;
        if(cu<0)continue;
        chmax(ans,i+b[cu]);
      }
    }
    else if(K==5){
      for(auto i:b){
        int cu=upper_bound(all(c),m-i)-c.begin();
        cu--;
        if(cu<0)continue;
        chmax(ans,i+c[cu]);
      }
    }
    else{
      for(auto i:c){
        int cu=upper_bound(all(c),m-i)-c.begin();
        cu--;
        if(cu<0)continue;
        chmax(ans,i+c[cu]);
      }
    }
    cout<<ans<<endl;
  }
}