#include <fstream>

using namespace std;

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

const int N=5001;

int g[N],p[N],profit[10001];

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