#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("rucsac.in");
ofstream g("rucsac.out");

int p[2][10002];
int l=0;

int main()

{
    int i,j,max1,gmax,n,s[5002],a[5002];
    f>>n>>gmax;
    for (i=1;i<=n;i++) f>>a[i]>>s[i];

    for (i=1; i<=n; i++, l=1-l)
      for (j=0; j<=gmax; j++)
      {
          p[1-l][j]=p[l][j];
          if (a[i]<=j)
            p[1-l][j]=max(p[1-l][j], p[l][j-a[i]] + s[i]);
      }
    max1=p[l][gmax];
    g<<max1;
    return 0;
}