/* -*- coding: utf-8 -*-
 *
 * 2329.cc:  No.2329 Nafmo、イカサマをする - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_K = 6;

/* typedef */

typedef long long ll;
typedef vector<ll> vl;

/* global variables */

int as[MAX_N];
vl svs[MAX_K + 1];

/* subroutines */

/* main */

int main() {
  int n, k;
  ll m;
  scanf("%d%lld%d", &n, &m, &k);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  sort(as, as + n);
  n = unique(as, as + n) - as;

  ll maxc = 0;
  if (k >= 1) {
    vl &sv1 = svs[1];
    for (int i0 = 0; i0 < n; i0++) sv1.push_back(as[i0]);
    auto vit = upper_bound(sv1.begin(), sv1.end(), m);
    if (vit != sv1.begin()) maxc = max(maxc, *(vit - 1));
  }
  if (k >= 2) {
    vl &sv2 = svs[2];
    for (int i0 = 0; i0 < n; i0++)
      for (int i1 = 0; i1 < n; i1++)
	sv2.push_back((ll)as[i0] + as[i1]);
    sort(sv2.begin(), sv2.end());
    sv2.erase(unique(sv2.begin(), sv2.end()), sv2.end());
    auto vit = upper_bound(sv2.begin(), sv2.end(), m);
    if (vit != sv2.begin()) maxc = max(maxc, *(vit - 1));
  }
  if (k >= 3) {
    vl &sv3 = svs[3];
    for (int i0 = 0; i0 < n; i0++)
      for (int i1 = 0; i1 < n; i1++)
	for (int i2 = 0; i2 < n; i2++)
	  sv3.push_back((ll)as[i0] + as[i1] + as[i2]);
    sort(sv3.begin(), sv3.end());
    sv3.erase(unique(sv3.begin(), sv3.end()), sv3.end());
    auto vit = upper_bound(sv3.begin(), sv3.end(), m);
    if (vit != sv3.begin()) maxc = max(maxc, *(vit - 1));
  }

  for (int i = 1; i <= 3 && i + 3 <= k; i++) {
    vl &svi = svs[i], &sv3 = svs[3];
    for (auto u: svi) {
      if (u > m) break;
      auto vit = upper_bound(sv3.begin(), sv3.end(), m - u);
      if (vit != sv3.begin()) maxc = max(maxc, u + *(vit - 1));
    }
  }

  printf("%lld\n", maxc);
  return 0;
}