#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,i,w[5010],p[5010],d[4][10010],cw;
int main()
{
    fin>>n>>g;
    for(i=1;i<=n;i++)
        fin>>w[i]>>p[i];
    for(i=1;i<=n;i++)
        for(cw=0;cw<=g;cw++)
        {
            d[i%2][cw]=d[1-i%2][cw];
            if(w[i]<=cw)
                d[i%2][cw]=max(d[i%2][cw],d[1-i%2][cw-w[i]]+p[i]);
        }
    fout<<d[n%2][g];
    return 0;
}