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

ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,k,g[10005],p[10005],i,j,d[5005][10005];

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