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

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

int profit[10001], k,g[10001],n,p[10001],maxm;
int main()
{
    int i,j;
    f>>n>>k;
    for (i=1;i<=n;i++)
        f>>g[i]>>p[i];
    for (i=1;i<=n;i++){
        for (j=k-g[i];j>=1;j--)
            if (profit[j]!=0 && profit[j]+p[i]>profit[j+g[i]])
                profit[j+g[i]]=profit[j]+p[i];
        if (g[i]<=k && p[i]>profit[g[i]])
            profit[g[i]]=p[i];
    }
    for (i=1;i<=k;i++)
        if (profit[i]>maxm)
            maxm=profit[i];
    go<<maxm;

    return 0;
}