#include <fstream>

using namespace std;

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

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

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--)
        {
            a[j] = max(a[j], a[j-w[i]]+p[i]);
            if (a[j] > max1)
                max1 = a[j];
        }

    fout << max1;
    return 0;
}