#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N, M; cin >> N >> M;

    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    sort(rall(A));

    vector<vector<ll>> dp(M+1, vector<ll>(2, -INF));
    dp[0][0] = 0;

    rep(i, N){
        vector<vector<ll>> tmp(M+1, vector<ll>(2, -INF));
        ll d = A[i]-(i == N-1? 0 : A[i+1]);

        rep(j, M+1){
            if(dp[j][0] != -INF){
                chmax(tmp[j][0], dp[j][0]);
                if(j+d <= M){
                    chmax(tmp[j+d][1], dp[j][0]+A[i]);
                }
            }
        }
        rep(j, M+1){
            if(dp[j][1] != INF){
                chmax(tmp[j][0], dp[j][1]);
                if(j+d <= M){
                    chmax(tmp[j+d][1], dp[j][1]);
                }
            }
        }

        swap(dp, tmp);
    }

    ll ans = -INF;
    rep(i, M+1) chmax(ans, dp[i][0]);

    cout << ans << '\n';
}