#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
constexpr int MD = 1000000007;
constexpr int INF = INT_MAX;
constexpr long long LINF = LLONG_MAX;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;using vi = vector<int>;using vll = vector<ll>;
template <class T>
using ps = pair<T, T>;
template <class T>
using vec = vector<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;  // ascendent

template <typename T>
int sz(const T& x) { return x.size(); }

// a = min(a,b)
template <typename T, typename S>
inline bool chmin(T& a, const S& b) {
  return (a > b ? a = b, 1 : 0);
}
template <typename T, typename S>
inline bool chmax(T& a, const S& b) {
  return (a < b ? a = b, 1 : 0);
}

ll mpow(int base, int exponent, int mod){
    if(exponent == 0) return 1;
    ll c = mpow(base, exponent/2, mod);
    c *= c;
    c %= mod;
    if(exponent % 2 == 1){
        c *= base;
        c %= mod;
    }
    return c;
}

/* 
auto push = [&](int r, int c){
    if(r < 0 || c < 0 || r >= h || c >= w) return;
    if(dist[r][c] != -1) return;
};
*/ //dfs/bfs埋め込み用

/*
class edge{
public:
    int to, weight;
    edge(int a, int b){
        to = a; weight = b;
    }
};
*/ //template of edge
/*class edge2{
public:
    int from, to, weight;
    edge2(int w, int a, int b){
        from = w; to = a; weight = b;
    }
};
bool comp(edge2 a, edge2 b){
    return a.weight < b.weight;
}
*/ //template of edge2
struct before_main_function {
  before_main_function() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
    std::cout << setprecision(20) << fixed;
#define endl "\n"
  }
} before_main_function;
vec<int > d, l;
vec<vec<int>> g;
void dfs(int p){
  for(auto it : g[p]){
    d[it] = max(d[p], l[it]);
    dfs(it);
  }
}
int main(int /*argc*/, char** /*argv*/){
  ll n, m, k;
  std::cin >> n >> m >> k;
  vec<int> a(n);
  REP(i, n) std::cin >> a[i];
  vec<vec<int>> st(4);
  st[0] = {0};
  st[1] = a;
  REP(i, n){
    if(a[i] > m) continue;
    REP(j, n){
      st[2].emplace_back(a[i]+a[j]);
    }
  }
  REP(i, n){
    if(a[i] > m) continue;
    REP(j, n){
      if(a[i]+a[j] > m) continue;
      REP(l, n){
        st[3].emplace_back(a[i]+a[j]+a[l]);
      }
    }
  }
  REP(i, 4){
    sort(st[i].begin(), st[i].end());
  }
  int ans = 0;
  if(k >= 1){
    REP(i, n){
      if(st[1][i]> m) break;
      chmax(ans, st[1][i]);
    }
  }
  if(k >= 3){
    for(int x = 2; x <= 3; x++){
    int sz = st[x].size();
    REP(i, sz){
      if(st[x][i]> m) break;
      chmax(ans, st[x][i]);
    }      
    }
  }
  if(k >= 4){
    int sz = st[2].size();
    REP(i, sz){
      auto it = upper_bound(st[2].begin(), st[2].end(), m-st[2][i])-st[2].begin();
      if(it == 0) break;
      chmax(ans, st[2][i]+st[2][it-1]);
    }
  }
  else if(k >= 5){
    int sz = st[2].size();
    REP(i, sz){
      auto it = upper_bound(st[3].begin(), st[3].end(), m-st[2][i])-st[3].begin();
      if(it == 0) break;
      chmax(ans, st[2][i]+st[3][it-1]);
    }
  }
  else if(k >= 6){
    int sz = st[3].size();
    REP(i, sz){
      auto it = upper_bound(st[3].begin(), st[3].end(), m-st[3][i])-st[3].begin();
      if(it == 0) break;
      chmax(ans, st[3][i]+st[3][it-1]);
    }
  }
  std::cout << ans << endl;
  return 0;
}