#include <fstream>

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