#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 1e5 + 5, M = 1005, lg = 19, mod = 998244353;


bool dp[M][N], mark[M][N];

int n, cap, a[M];


bool solve(int idx, int rem) {
    if(idx == n) return rem == 0;
    if(mark[idx][rem]) return dp[idx][rem];
    mark[idx][rem] = 1;

    bool op1 = solve(idx + 1, rem);
    bool op2 = 0;
    if(a[idx] >= rem) op2 = solve(idx + 1, rem - a[idx]);

    return dp[idx][rem] = (op1 | op2);
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);


    cin >> n >> cap;
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    ll total = accumulate(a, a + n, 0LL);

    if(total <= cap) {
        cout << total;
        return 0;
    }

    ll mn = total, pref = 0;
    int z = 0;
    for(int i = 0; i < n; i++) {
        if(pref <= cap) {
            int from = a[i] - 1, to = 0;
            from = min(0LL + from, cap - pref);
            for(int j = from; j >= z; j--) {
                if(cap - pref - j < 0) break;
                if(solve(i + 1, cap - pref - j)) {
                    mn = min(mn, 0LL + cap - j);
                    z = j;
                    break;
                }
            }
        }
        pref += a[i];
    }
    cout << mn;






    return 0;
}