#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[2][10002],i,j,n,G;
int i1=0,i2=1;

int p[10002],g[10002];
int main()
{
    fin>>n>>G;
    for(i=1;i<=n;i++)
        {
         fin>>g[i]>>p[i];
        }
    for(i=1;i<=n;i++)
    {
     for(j=1;j<=G;j++)
     {
         if(g[i]>j)
             {
                dp[i2][j]=dp[i1][j];
             }
        else
            {
             dp[i2][j]=max(dp[i1][j],dp[i1][j-g[i]]+p[i]);
            }
     }
     i1=1-i1;
     i2=1-i2;
    }
    fout<<dp[0][G];
    return 0;
}