#include <fstream>

using namespace std;

int n, d[10005],p,g,G,maxim;///nr de submultimi ce pot fi formate cu nr de la 1 la i;

ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");


int main()
{
    cin >> n >> G;
    for(int i = 1; i<=n; i++)
        d[i] = -1;
        for(int i = 1; i<=n; i++)
    {
        cin >> g >> p;
        for(int j = G-g; j>=0;j--)
        {
            if(d[j] + p > d[j+g])
            {
                d[j+g] = d[j] + p;
            }
        }
    }
    for(int j = 1; j<=G;j++)
    {
        maxim = max(maxim,d[j]);
    }
    cout << maxim;
    return 0;
}