#include <fstream>

using namespace std;

ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");

int M[2][10001],gr[5001],pr[5001],G,n,k;

int main()
{
    cin>>n>>G;
    for (int i=1; i<=n; ++i)
    {
        int x,y;
        cin>>x>>y;
        gr[i]=x;
        pr[i]=y;
    }
    for (int i=1; i<=n; ++i)
        for (int j=1; j<=G; ++j)
        {
            if (j>=gr[i]) M[i%2][j]=max(M[(i-1)%2][j],M[(i-1)%2][j-gr[i]]+pr[i]);
            else M[i%2][j]=M[(i-1)%2][j];
        }
    cout<<M[n%2][G];

    return 0;
}