#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;

const int tM = 20;

bool dp[tM][tM], mark[tM][tM];

int n, cap, a[M];


bool solve(int idx, int rem) {
    // cout << idx << ' ' << rem << '\n';
    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);
}

ll getOptimal() {
    ll ans = accumulate(a, a + n, 0);
    for(int mask = 0; mask + 1 < (1 << n); mask++) {
        ll mn = 10000, tAns = 0;
        for(int bit = 0; bit < n; bit++) {
            if(mask >> bit & 1) {
                tAns += a[bit];
            }
            else mn = min(mn, 0LL + a[bit]);
        }
        if(tAns <= cap && tAns + mn > cap) {
            ans = min(ans, tAns);
        }
    }
    return ans;
}


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

    srand(time(0));


    // cin >> n >> cap;
    int tc = 0;
    while(1) {
        // cout << ++tc << endl;
        // memset(mark, 0, sizeof mark);
        // n = rand() % 3 + 4;
        // cap = rand() % 5 + 1;
        cin >> n >> cap;
        for(int i = 0; i < n; i++) {
            cin >> a[i];
            // a[i] = a[i] % cap + 1;
        }

        // ll optimalAns = getOptimal();
        sort(a, a + n);
        ll total = accumulate(a, a + n, 0LL);

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

        ll mn = total, pref = 0;
        for(int i = cap; i >= 0; i--) {
            if(solve(0, i)) {
                mn = i;
                break;
            }
        }
        // cout << "HERE " << mn << '\n';
        int mxJ = -1;
        for(int i = 0; i < n; i++) {
            if(pref <= cap) {
                for(int j = 0; j < a[i]; j++) {
                    // cout << "j " << i << ' ' << j << ' ' << a[i] << '\n';
                    mxJ = max(mxJ, j);
                    if(cap - pref - j < 0) {
                        // cout << "BREAK " << i << ' ' << j << ' ' << a[i] << '\n';
                        break;
                    }
                    if(solve(i + 1, cap - pref - j)) {
                        // cout << "cap - j" << ' ' << cap - j << ' ' << cap << ' ' << j << '\n';
                        mn = min(mn, 0LL + cap - j);
                    }
                }
            }
            pref += a[i];
        }
        cout << mn;
        return 0;
    }






    return 0;
}