#include <fstream>
#include <algorithm>

using namespace std;

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

const int N = 5005;
int g[N], p[N], best[10005];


int main()
{
    int n, G, i, j;
    in >> n >> G;
    for(i = 1; i <= n; i++)
        in >> g[i] >> p[i];
    for(i = 1; i <= G; i++)
        best[i] = -1;
    best[0] = 0;
    for(i = 1; i <= n; i++)
    {
        for(j = G - g[i]; j >= 0; j--)
            if(best[j] != -1 && best[j + g[i]] < best[j] + p[i])
                best[j + g[i]] = best[j] + p[i];
    }
    int maxim = 0;
    for(i = 1; i <= G; i++)
        maxim = max(maxim, best[i]);
    out << maxim;

    return 0;
}