knapsack(dp)

var
    f:array[0..1000,0..1000] of int64;
    w:array[0..1000] of int64;
    i,j,n,m,r:longint;

function max(a,b:longint):longint;
 begin
   if a>b then
      max:=a
   else
   max:=b;
 end;

Begin
  read(n,m);
  for i:=1 to n do
    read(w[i]);
 for i:=1 to n do
   for j:=1 to m do
     if (j >= w[i]) then
        f[i][j]:=max(f[i-1][j],f[i-1][j-w[i]] + w[i])
    else
    f[i][j]:=f[i-1][j];
end.