#include<iostream>
#include<algorithm>
using namespace std;
long long n,m,i,a[1001],e,j,b[20001],s,h,y;
int main () {
cin>>n>>m;
for(i=1;i<=n;i++) {
 cin>>a[i];
 s=s+a[i];
}
sort(a+1,a+1+n);
b[a[1]]=1;
e=a[1];
for(i=2;i<=n;i++) {

 for(j=1;j<=e;j++) {
  if(b[j]==1 && j+a[i]<=s) {
   b[j+a[i]]=1;

  }
 }
  b[a[i]]=1;
if(e+a[i]<=s) e=e+a[i];
else e=s;
}
if(b[m]==1) {
 cout<<m<<endl;
}
else {
 for(i=m-1;i>=1;i--) {
  if(b[i]==1) {
   h=i;
   break;
  }
 }
 for(i=m+1;i<=s;i++) {
  if(b[i]==1) {
   y=i;
   break;
  }
 }
 if(m-h<=y-m) {
  cout<<h<<endl;
 }

 if(m-h>y-m) {
  cout<<y<<endl;
 }

}
return 0;
}
