#include <iostream>
#include <fstream>

using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int prof[10001];
int main()
{
    int n, G, i, j, g, p, rez=0;
    in >> n >> G;
    for(i = 1; i <= G; i++)
        prof[i] = -999999999;
    for(i = 1; i <= n; i++)
    {
        in >> g >> p;
        for(j = G - g; j >= 0; j--)
        {
            if(prof[j] + p > prof[j + g])
            {
                prof[j + g] = prof[j] + p;
            }
        }
    }
    for(i = G; i >= 1; i--)
        rez = max(rez, prof[i]);
    out << rez;
    return 0;
}