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

    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
int n, g, gr[5001], pr[5001], d[5001][10001];
int main()
{
    fin>>n>>g;
    for(int i=1;i<=n;i++)
        fin>>gr[i]>>pr[i];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=g;j++)
        {
            d[i][j]=d[i-1][j];
            if(gr[i]<=j)
            d[i][j]=max(d[i-1][j],d[i-1][j-gr[i]]+pr[i]);
        }
    fout<<d[n][g];

    return 0;
}