#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = 1 << 30 - 1;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> a(n); rep(i, n) cin >> a[i];
    vector<ll> sum1, sum2, sum3;
    rep(i, n) sum1.pb(a[i]);
    rep(i, n) rep(j, n) sum2.pb(a[i]+a[j]);
    rep(i, n) rep(j, n) rep(l, n) sum3.pb(a[i]+a[j]+a[l]);
    sort(all(sum1));
    sort(all(sum2));
    sort(all(sum3));

    ll ans = 0;
    if(k >= 1){
        auto itr = upper_bound(all(sum1), m);
        if(itr != sum1.begin()){
            itr--;
            ans = max(ans, *itr);
        }
    }

    if(k >= 2){
        auto itr = upper_bound(all(sum2), m);
        if(itr != sum2.begin()){
            itr--;
            ans = max(ans, *itr);
        }
    }

    if(k >= 3){
        auto itr = upper_bound(all(sum3), m);
        if(itr != sum3.begin()){
            itr--;
            ans = max(ans, *itr);
        }
    }

    if(k <= 4){
        for(ll i=0; i<(ll)sum2.size(); i++){
            auto itr = upper_bound(all(sum2), m-sum2[i]);
            if(itr != sum2.begin()){
                itr--;
                ans = max(ans, *itr+sum2[i]);
            }
        }
    }

    if(k >= 5){
        for(ll i=0; i<(ll)sum2.size(); i++){
            auto itr = upper_bound(all(sum3), m-sum2[i]);
            if(itr != sum3.begin()){
                itr--;
                ans = max(ans, *itr+sum2[i]);
            }
        }
    }

    if(k >= 6){
        for(ll i=0; i<(ll)sum3.size(); i++){
            auto itr = upper_bound(all(sum3), m-sum3[i]);
            if(itr != sum3.begin()){
                itr--;
                ans = max(ans, *itr+sum3[i]);
            }
        }
    }

    cout << ans << endl;
}