#include <fstream>

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