Program probleama_rucsacului;
const inf=-100000000;
 var sol:array [0..10001] of longint;
     i,j,n,g,k,w,p:longint;
     b1:array [1..1 shl 12] of char;
     fi,fo:text;
function max(a,b:longint):longint;
begin
if a>b then max:=a
  else max:=b;
end;
begin
 assign(fi,'rucsac.in');
  assign(fo,'rucsac.out');
 settextbuf(fi,b1);
 reset(fi);
 rewrite(fo);
 readln(fi,n,g);
 for i:=1 to g do sol[i]:=inf;
 for i:=1 to n do begin
                  readln(fi,w,p);
                  k:=g;
                  for j:=g-w downto 0 do begin
                   sol[k]:=max(sol[k],sol[j]+p);
                   dec(k);
                   end;
                  end;
 p:=0;
 for i:=1 to g do
                p:=max(p,sol[i]);
 write(fo,p);
close(fo);
end.