#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
#define IO ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

const int N=1e5+5;
bool dp[1005][N],vis[1005][N];
int a[1005];
int mn,n,c;
bool solve(int id,int rem)
{

    if(id==n+1)return rem==0;
    bool &ret=dp[id][rem];
    if(vis[id][rem])return ret;
    vis[id][rem]=1;
    ret=solve(id+1,rem);
    if(rem>=a[id])ret|=solve(id+1,rem-a[id]);
    return ret;
}
int main()
{
    // IO
    cin>>n>>c;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    int sum=0;
    int mx=0;
    for(int i=1;i<=n;i++)
    {
        if(sum>c)break;
        mn=a[i];
        int tmp=c-sum;
        for(int j=0;j<mn;j++)
        {
            if(tmp-j<0)break;
            if(solve(i+1,tmp-j))mx=max(mx,j);
        }
        sum+=a[i];
    }
    if(sum<=c)mx=max(mx,c-sum);
    cout<<c-mx;
    return 0;
}