program ruksak;
var
    i, j, g, max, n : longint;
    w, p : array[1..3000] of integer;
    op : array[0..3000] of integer;
begin
  assign(input, 'rucsac.in');
  reset(input);
  read( n, g);
  for i:=1 to n do read(w[i], p[i]);
  op[0]:=0;
  max:=0;
  for i:=1 to n do
   for j:=g downto w[i] do
    if op[j-w[i]]+p[i]>op[j] then begin
                                    op[j]:=op[j-w[i]]+p[i];
                                    if op[j]>max then max:=op[j];
                                  end;
  assign(output, 'rucsac.out');
  rewrite(output);
  write( max);
end.