#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	vector<long long>v = { 0 };
	rep(i, n) {
		v.push_back(a[i]);
		rep(j, n) {
			v.push_back(a[i] + a[j]);
			rep(k, n) {
				v.push_back(a[i] + a[j] + a[k]);
			}
		}
	}
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	long long ans = 0;
	rep(i, v.size()) {
		long long a = v[i];
		if (a > m)continue;
		long long b = m - a;
		int cnt = upper_bound(all(v), b) - v.begin();
		if (0 != cnt)chmax(ans, a + v[cnt - 1]);
	}
	cout << ans << endl;
	return 0;
}