#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; ll m; cin >> n >> m >> k;
  vector<int> a(n); REP(i, n) cin >> a[i];
  ranges::sort(a);
  a.erase(unique(a.begin(), a.end()), a.end());
  n = a.size();
  const auto generate = [&](int num) -> vector<ll> {
    vector<ll> res{0};
    while (num--) {
      vector<ll> nxt;
      nxt.reserve(res.size() * n);
      for (const ll x : res) {
        REP(i, n) nxt.emplace_back(x + a[i]);
      }
      ranges::copy(nxt, back_inserter(res));
      ranges::sort(res);
      res.erase(unique(res.begin(), res.end()), res.end());
    }
    return res;
  };
  const vector<ll> x = generate(k / 2), y = generate((k + 1) / 2);
  ll ans = 0;
  for (const ll x_i : x) {
    if (x_i > m) break;
    const auto it = ranges::upper_bound(y, m - x_i);
    if (it != y.begin()) chmax(ans, x_i + *prev(it));
  }
  cout << ans << '\n';
  return 0;
}