#include <iostream>
#include <fstream>
using namespace std;

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

int dp[10005], n, greut, maxi;
pair<int,int>perechi[5005];

void adaugare_dp(pair<int,int>a)
{
    for (int i=greut; i>=a.first; --i)
    {
        if (dp[i-a.first]>=0)
            dp[i]=max(dp[i],dp[i-a.first]+a.second);
    }
}

int main()
{
    f >> n >> greut;
    for (int i=1; i<=greut; ++i)
    {
        dp[i]=-1;
    }
    for (int i=1; i<=n; ++i)
    {
        f >> perechi[i].first >> perechi[i].second;
        adaugare_dp(perechi[i]);
    }
    for (int i=1; i<=greut; ++i)
        if (dp[i]>maxi)
        maxi=dp[i];
    g << maxi;
    return 0;
}