#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <cassert>

using namespace std;
using ll = long long;

vector<int> idx;

void _dfs(int N, int mi, int mx, vector<vector<int>> &A){
    if (idx.size() == N){
        A.push_back(idx);
        return;
    }
    else{
        for (int i = mi; i <= mx; i++){
            idx.push_back(i);
            _dfs(N, mi, mx, A);
            idx.pop_back();
        }
    }
}

//mi~mxのN重ループを返す。
vector<vector<int>> nested_loop(int N, int mi, int mx){
    vector<vector<int>> res;
    _dfs(N, mi, mx, res);
    return res;
}

int main(){

    ll N, M, K, S, ans=0;
    cin >> N >> M >> K;
    vector<ll> A(N), v;
    for (int i=0; i<N; i++) cin >> A[i];
    vector<vector<int>> p = nested_loop(K/2, -1, N-1), q = nested_loop(K-K/2, -1, N-1);
    for (auto &x : p){
        S = 0;
        for (auto y : x){
            if (y == -1) continue;
            S += A[y];
        }
        v.push_back(S);
    }

    sort(v.begin(), v.end());

    for (auto &x : q){
        S = 0; 
        for (auto y : x){
            if (y == -1) continue;
            S += A[y];
        }
        auto it = upper_bound(v.begin(), v.end(), M-S);
        if (it == v.begin()) continue;
        it--;
        ans = max(ans, S + *it);
    }

    cout << ans << endl;

    return 0;
}