#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int g[10001],p[5001],profit[10001];


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

    return 0;
}