#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P       = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

signed main() {
    int n, k;
    cin >> n >> k;
    vector<int> ws(n);
    for (auto &w : ws) {
        cin >> w;
    }

    vector<vector<int>> dp(n + 10, vector<int>(k + 10, 0));
    rep(i, 0, n) {
        rep(sum_w, 0, k + 1) {
            int w = ws[i];
            // i番目の商品を選ぶ場合
            if (sum_w - w >= 0) {
                chmax(dp[i + 1][sum_w], dp[i][sum_w - w] + w);
            }

            // i番目の商品を選ばない場合
            chmax(dp[i + 1][sum_w], dp[i][sum_w]);
        }
    }

    cout << dp[n][k] << endl;
}