#include <fstream>

using namespace std;

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

int n, g, i, j, max1;
int w[5001], p[5001], r[10001];

int main()
{
    fin >> n >> g;
    for (i = 1; i <= n; i++)
        fin >> w[i] >> p[i];

    for (i = 1; i <= n; i++)
    {
        for (j = g; j >= w[i]; j--)
            if (r[j-w[i]]+p[i] > r[j])
                r[j] = r[j-w[i]]+p[i];
    }
    for (i = 1; i <= g; i++)
        if (r[i] > max1)
            max1 = r[i];
    fout << max1;
    return 0;
}