#include <fstream>

using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j, w[5005], p[5005], dp[2][10005];
int main()
{
    fin>>n>>g;
    for(i=1; i<=n; i++)
        fin>>w[i]>>p[i];
    for(i=1; i<=n; i++)
        for(j=1; j<=g; j++)
        {
            if(w[i]>j)
                dp[i%2][j]=dp[(1+i)%2][j];
            else
                dp[i%2][j]=max(dp[(1+i)%2][j], dp[(1+i)%2][j-w[i]]+p[i]);
        }
    fout<<dp[n%2][g];
    return 0;
}