#include<bits/stdc++.h>
using namespace std;
#define ERROR ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); fileIO();
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
void fileIO(){
    #ifndef ONLINE_JUDGE
    freopen("io\\input.txt", "r", stdin);
    freopen("io\\output.txt", "w", stdout);
    #endif
}

const ll mod = 1e9 + 7, N = 1e3 + 5, M = 1e5 + 5;
ll n, c;
ll a[N];
bool taken[N];
ll dp[N][M];

ll solve(int idx, ll rem, int mnIdx){

    if(idx == n){
        return (rem < a[mnIdx] || mnIdx == n? c - rem : 1e12);
    }

    ll& ret = dp[idx][rem];

    if(~ret)
        return ret;
    
    ret = solve(idx + 1, rem, mnIdx);
    
    if(rem >= a[idx]){
        ret = min(ret, solve(idx + 1, rem - a[idx], mnIdx + (idx == mnIdx)));
    }

    return ret;
}


void TestCase(){
    
    memset(dp, -1, sizeof dp);

    cin >> n >> c;

    for(int i = 0; i < n; i++)
        cin >> a[i];
    
    sort(a, a+n);

    cout << solve(0, c, 0) << '\n';

}

int main() {
    
    ERROR;

    int t = 1;
    //cin >> t;

    while(t--)
        TestCase();

}