#include <fstream>
#include <algorithm>
#define nmax 5001
#define cmax 10001
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");

int dp[cmax], g[nmax], c[nmax], n, m;

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>g[i]>>c[i];

    /// dinamica rucsac parcursa invers cu doar o dimensiune

    for(int i=1; i<=n; i++)
    {
        for(int j=cmax; j>=0; j--)
        {
            if(j>=g[i])
                dp[j] = max(dp[j],dp[j-g[i]]+c[i]);
        }
    }
    cout<<dp[m];
}