#include <iostream>
#include <algorithm>
using namespace std;
int main ()
{
    int n, w, a[1024], i, j, x, sum, max=0;
    cin>>n>>w;
    for (i=0;i<n;i++)
        cin>>a[i];
    sort (a, a+n);
    x=n-1;
    while (a[x]>w)
          x--;
    for (i=x;i>=0;i--)
    {
        sum=0;
        for (j=i;j>=0;j--)
            sum=sum+((sum+a[j])<=w)*a[j];
        if (sum>max) max=sum;
    }
    cout<<max<<endl;
    //system ("pause");
    return 0;
}
