#include <bits/stdc++.h>

using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int w[5010], p[5010], d[10010], n, G, Max;
int main()
{
    in >> n >> G;
    for(int i = 1;i <= n;i++)
        in >> w[i] >> p[i];
    for(int i = 1;i <= n;i++)
        for(int j = G;j - w[i] >= 0;j--)
        {
            d[j] = max(d[j],d[j - w[i]] + p[i]);
            Max = max(Max, d[j]);
        }
    out << Max;
    return 0;
}