#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

void solve() {
    int N, C; cin >> N >> C;
    vi v(N);
    
    for(int i = 0; i < N; i++) cin >> v[i];
    sort(v.begin(), v.end(), greater<int>());
    vector<bitset<100001>> dp(N + 1, 0);
    dp[0][0] = 1;
    bitset<100001> val = 0;
    for(int i = 0; i <= C; i++) val[i] = 1;
    for(int i = 1; i <= N; i++) {
        dp[i] = (dp[i - 1] | (dp[i - 1] << v[i - 1]));
    }
    int sum = 0;
    int toErase = 0;
    int ans = C;
    for(int i = N - 1; i >= 0; i--) {
        bitset<100001> b = (dp[i] << sum) & val;
        ans = min(ans, (int) ((((b << v[i]) & val) >> v[i]) ^ b)._Find_first());
        sum += v[i];
    }
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(); cin.tie(0);
    int T = 1;
    //cin >> T;
    while(T--) {
        solve();
    }
}