#include <bits/stdc++.h>

using namespace std;

ifstream f("rucsac.in");
ofstream g("rucsac.out");

int n,G,i,j,w[5010],p[5010],dp[3][10100];

int main()
{
    f>>n>>G;
    for(i=1;i<=n;i++)f>>w[i]>>p[i];

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=G;j++)
        {
            dp[i%2][j]=max(dp[i%2][j],dp[(i-1)%2][j]);
            if(j-w[i]>=0)dp[i%2][j]=max(dp[i%2][j],dp[(i-1)%2][j-w[i]]+p[i]);
        }
    }

    g<<dp[n%2][G];
    return 0;
}