#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");

int profit[10001],g[5001],p[5001],n,k;
int main(){
    //profit[j] = profitul maxim care poate fi obtinut cu obiecte care au suma gr = j
    in>>n>>k;
    int i,j,max;
    for(j=1;j<=k;j++)
        profit[j] = -1;

    for(i=1;i<=n;i++){
        in>>g[i]>>p[i];
    }
    profit[0] = 0;
    for(i=1;i<=n;i++)
        for(j=k-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];
    max=profit[1];
    for(i=2;i<=k;i++)
        if(profit[i]>max)
            max=profit[i];
    out<<max;
    return 0;
}