var i,j,k,t,w,now:longint;

 tree:array[..,..] of longint;

 f:array[..,..,..] of longint;

 function max(a,b:longint):longint;

 begin

   if a>b then exit(a)

     else exit(b);

 end;

 begin

   readln(t,w);

   for i:= to t do

     begin

       readln(now);

       tree[now,i]:=;

     end;

     for i:= to t do

     for j:= to w+i-max(i,w) do

       for k:= to  do

         begin

           if (j=) and (k<>) then begin

             f[k,j,i]:=f[k,j,i-]+tree[k,i];

             continue;

           end

           else if j= then continue;

           f[k,j,i]:=max(f[k,j,i],tree[k,i]+max(f[-k,j-,i-],f[k,j,i-]));

           //writeln(i,' ',j,' ',f[k,j,i]);

         end;

   writeln(max(f[,w,t],f[,w,t]));

 end.