#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = a; i >= b; i--)
#define F0Rd(i,a) for (int i = a; i >= 0; i--)
#define FORit(it,a) for (auto it = a.begin(); it != a.end(); it++)
#define trav(a,x) for (auto& a: x)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define alla(arr, sz) arr, arr + sz

const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4*1e18;
const int inf = 1000000007;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

#define DEBUG 0

void solve() {
    int n, c; cin >> n >> c;
    vi v(n); trav(x,v) cin >> x;
    sort(all(v));

    int dp[n+1][c+1]; // dp[i][j] = least capacity used considering first i indices and total capacity j
    // dp[0][0] = 0;
    FOR(i,1,n+1) dp[i][0] = 0;
    FOR(j,1,c+1) {
        if (j < v[0]) dp[1][j] = 0; 
        else dp[1][j] = v[0];
    }
    FOR(i,2,n+1) {
        FOR(j,1,c+1) {
            dp[i][j] = inf;
            if (j-dp[i-1][j] < v[i-1]) {
                dp[i][j] = dp[i-1][j];
            }
            if (j-v[i-1] >= 0)
                dp[i][j] = min(dp[i][j], dp[i-1][j-v[i-1]] + v[i-1]);
            if (dp[i][j] == inf) dp[i][j] = 0;
        }
    }

    cout << dp[n][c];
}

int main() {
  #if DEBUG
  setIn("test.in");
  #else
  setIO();
  #endif

  int t;
  t= 1;  
  //cin >> t;
  while (t--) 
    solve();

  return 0;
}