#include <cstdio>
#include <utility>
#include <algorithm>
using namespace std;
std::pair<int,int> O[5005];
int V[5005][5005];
int main()
{
    int N,G;
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d%d",&N,&G);
    for( register int i=1;i<=N;++i )
        scanf("%d%d",&O[i].first,&O[i].second);
    for(register int i=1;i<=N;++i)
        for(register int j=1;j<=G;++j)
            if( O[i].first > j ) V[i][j]=V[i-1][j];
            else V[i][j]=max( V[i-1][j],V[i-1][j-O[i].first]+O[i].second );
    printf("%d",V[N][G]);
    return 0;
}