#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
int dp[3][10001];
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int main()
{
    int n,g,i,j;
    cin>>n>>g;
    int w[n+1],p[n+1];
    for(i=1;i<=n;i++)
    {
        cin>>w[i]>>p[i];
    }

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