#include <bits/stdc++.h>
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int c[10005];
int n,G;
int g[5005];
int p[5005];
int lin;

void read()
{
    int i,j;
    fin>>n>>G;
    for(i=1;i<=n;++i)
        fin>>g[i]>>p[i];
}

void solve()
{
    int i,j,lp,lc;
    for(i=1;i<=n;++i)
        {
         for(j=G;j>=1;--j)
            if(g[i]<=j)
            {
             c[j]=max(c[j],p[i]+c[j-g[i]]);
            }
        }
    fout<<c[G];


}

int main()
{
    read();
    solve();
    return 0;
}