#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n,g,DP[3][1005],i,j,p[5005],w[5005];

void Read()
{
    fin>>n>>g;
    for(i=1;i<=n;i++)
        fin>>w[i]>>p[i];
}

void Solve()
{
    int l=0;
    for(i=1;i<=n;i++,l=1-l)
        for(j=0;j<=g;j++){
            DP[1-l][j]=DP[l][j];
            if(w[i]<=j)
                DP[1-l][j] = max(DP[1-l][j],DP[l][j-w[i]]+p[i]);
        }
    fout<<DP[l][g];
}

int main()
{
    Read();
    Solve();
    return 0;
}