#include <iostream>
#include <fstream>
using namespace std;

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

const int N=5002;
int profit[N],p[N],g[N];
int n,gr,maxim;
int main()
{
    in>>n>>gr;
    for(int i=0; i<n; ++i) in>>g[i]>>p[i];
    profit[0]=0;
    for(int i=1; i<=gr; ++i) profit[i]=-1;

    for(int i=0; i<n; ++i)
    {
        for(int j=gr-g[i]; j>=0; --j)
            if(profit[j]!=-1 && profit[j]+p[i]>profit[j+g[i]])
                profit[j+g[i]]=profit[j]+p[i];
    }
    for(int i=1; i<=gr; ++i)
        maxim=max(maxim,profit[i]);

    out<<maxim;
    return 0;
}