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

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

int w[10005], n, G, i, j, p, g;

int main()
{
    fin >> n >> G;
    for(i = 1; i <= n; ++ i)
    {
        fin >> p >> g;
        for(j = G; j >= p; j --)
            w[j] = max(w[j], w[j - p] + g);
    }
    fout << w[G];
    return 0;
}