#include <iostream>
#include <fstream>
using namespace std;

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

int dp[10005], n, G;

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