#include <iostream>
#include <fstream>

using namespace std;

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

int n, g, d[10002], w[5002], p[5002], mx, d1[2][10002];
/** d[i][j] = profitul maxim pe care il putem obtine cu o submultime a primelor i elemente cu
greutatea totala j */

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

    for (int i = 1; i <= n; i++)
    {
        for (int j = g - w[i]; j >= 0; j--)
        {
            if (d[j + w[i]] < d[j] + p[i])
            {
                d[j + w[i]] = d[j] + p[i];
                mx = max(mx, d[j + w[i]]);
            }
        }
    }
    fout << mx;

    fin.close();
    fout.close();
    return 0;
}