#include <fstream>
#include <algorithm>
using namespace std;
int D[2][10003], G[5002], P[5002],N,Gr;
bool u=0;
int main(){
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>N>>Gr;
for (int i=1; i<=N; i++) fin>>G[i]>>P[i];
for (int i=1; i<=N; i++,u=!u) 
    for (int j=1; j<=Gr; j++)
        {D[u][j]=D[!u][j];
        if(j>=G[i]){
        D[u][j]=max(D[!u][j],D[!u][j-G[i]]+P[i]);
        }
        }
fout<<D[!u][Gr];
return 0;
}