#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <ctime>
#include <utility>
#include <random>
#include <tuple>
#include <bitset>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>

template<typename T> void debug(T e){
    cerr << e << endl;
}

template<typename T> void debug(vector<T> &v){
    rep(i, v.size()){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

template<typename T> void debug(vector<vector<T>> &v){
    rep(i, v.size()){
        rep(j, v[i].size()){
            cerr << v[i][j] << " ";
        }
        cerr << endl;
    }
}

template<typename T> void debug(vector<pair<T, T>> &v){
    rep(i,v.size()){
        cerr << v[i].first << " " << v[i].second << endl;
    }
}

template<typename T> void debug(set<T> &st){
    for (auto itr = st.begin(); itr != st.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(multiset<T> &ms){
    for (auto itr = ms.begin(); itr != ms.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(map<T, T> &mp){
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out(){
    cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod){
    //　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0){
        ret = 1;
    }
    else if (n % 2 == 1){
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    }
    else{
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod){
    return my_pow(x, mod - 2, mod);
}

int main(){
    ll N, M, K;
    cin >> N >> M >> K;
    vl A(N);
    rep(i,N) cin >> A[i];
    A.push_back(0);
    N++;

    ll ans = 0;
    
    if (K == 1){
        for (ll i = 0; i < N; i++){
            if (A[i] <= M) ans = max(ans, A[i]);
        }
    }
    else if (K == 2){
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < N; j++){
                if (A[i] + A[j] <= M) ans = max(ans, A[i] + A[j]);
            }
        }
    }
    else if (K == 3){
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < N; j++){
                for (ll k = 0; k < N; k++){
                    if (A[i] + A[j] + A[k] <= M) ans = max(ans, A[i] + A[j] + A[k]);
                }
            }
        }
    }
    else if (K == 4){
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < N; j++){
                for (ll k = 0; k < N; k++){
                    for (ll l = 0; l < N; l++){
                        if (A[i] + A[j] + A[k] + A[l] <= M) ans = max(ans, A[i] + A[j] + A[k] + A[l]);
                    }
                }
            }
        }
    }
    else{
        vl former(0);
        vl latter(0);
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < N; j++){
                for (ll k = 0; k < N; k++){
                    former.push_back(A[i] + A[j] + A[k]);
                }
            }
        }
        if (K == 5){
            for (ll i = 0; i < N; i++){
                for (ll j = 0; j < N; j++){
                    latter.push_back(A[i] + A[j]);
                }
            }
        }
        else{
            for (ll i = 0; i < N; i++){
                for (ll j = 0; j < N; j++){
                    for (ll k = 0; k < N; k++){
                        latter.push_back(A[i] + A[j] + A[k]);
                    }
                }
            }
        }
        sort(all(latter));
        //debug(former);
        //debug(latter);
        for (ll i = 0; i < former.size(); i++){
            if (former[i] + latter[0] > M){
                // 何もしない
            }
            else if (former[i] + latter[latter.size() - 1] <= M){
                ans = max(ans, former[i] + latter[latter.size() - 1]);
            }
            else{
                auto itr = lower_bound(all(latter), M + 1 - former[i]);
                itr--;
                ans = max(ans, *itr + former[i]);
            }
        }
    }
    cout << ans << endl;
}