#include <fstream>
using namespace std;

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

int dp[10005], greutati[5005], profituri[5005];

int main()
{
    int N, G;
    fin >> N >> G;
    for (int i = 1; i <= N; i++)
    {
        fin >> greutati[i] >> profituri[i];
    }
    dp[0] = 0;
    for (int i = 1; i <= N; i++)
    {
        for (int g = G; g >= 0; g--)
        {
            if(g+greutati[i] <= G)
            dp[g + greutati[i]] = max(dp[g + greutati[i]], dp[g] + profituri[i]);
        }
    }
    fout << dp[G] << "\n";
    return 0;
}