#include <iostream>
#include <fstream>

using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");

const int Nmax = 5005, Gmax = 10005;

int n, Gr, DP[2][Gmax], G[Nmax], P[Nmax];

void Read()
{
    f>>n>>Gr;
    for(int i = 1; i <= n; i++) f>>G[i]>>P[i];
}

void Solve()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= Gr; j++)
        {
            //DP[1][j] = DP[0][j];
            if(G[i] <= j)
                DP[1][j] = max(DP[0][j], DP[0][j-G[i]] + P[i]);
        }
        for(int j = 0; j <= Gr; j++) DP[0][j] = DP[1][j];
    }
}

void Print()
{
    g<<DP[1][Gr];
}

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}