#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[5001][10001], w[5001], p[5001], n, g;
int main()
{
    int i, j;
    fin>>n>>g;
    for(i=1; i<=n; i++)
        fin>>w[i]>>p[i];
    fin.close();
    for(i=1; i<=n; i++)
        for(j=0; j<=g; j++)
        {
            dp[i][j]=dp[i-1][j];
            if(w[i]<=j)
                dp[i][j]=max(dp[i][j], dp[i-1][j-w[i]]+p[i]);
        }
    fout<<dp[n][g]<<'\n';
    fout.close();
    return 0;
}