#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int n;
vll a;
vvll b(2);
void dfs(vll &c, int l, int depth){
    int len = c.size();
    if(len == l){
        ll s = 0; rep(i, len)s += c[i];
        b[depth].push_back(s);
    }else{
        rep(i, n){
            c.push_back(a[i]);
            dfs(c, l, depth);
            c.pop_back();
        }
    }
}


int main(){
    ll m; int k; cin >> n >> m >> k;
    rep(i, n){
        ll d; cin >> d;
        a.push_back(d);
    }
    if(k == 1){
        ll ans = 0;
        rep(i, n){
            if(a[i] <= m)ans = max(ans, a[i]);
        }
        cout << ans << 0;
        return 0;
    }
    
    rep(i, k/2){
        vll c(0);
        dfs(c, i+1, 0);
    }
    rep(i, k - k/2){
         vll c(0);
        dfs(c, i+1, 1);
    }
    b[0].push_back(0);
    b[1].push_back(0);

    sort(all(b[0]));
    int len = b[0].size();
    ll ans = 0;
    for(auto i : b[1]){
        if(i > m)continue;
        if(i + b[0][len-1] <= m){
            ans = max(ans, i+b[0][len-1]);
            continue;
        }
        ll l = *prev(upper_bound(all(b[0]), m-i));
        ans = max(ans, i + l);
    }
    cout << ans << endl;
    return 0;
}