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

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

long n, g;
long G[10005];
long P[10005];
long V[10005];

int main()
{
    fin >> n >> g;
    for(long i = 1; i <= n; ++i)
        fin >> G[i] >> P[i];

    V[0] = 0;

    for(long i = 1; i <= n; ++i)
    {
        for(long j = g; j >= G[i]; --j)
        {

           if(V[j-G[i]] + P[i] > V[j])
                V[j] = V[j-G[i]] + P[i];

        }
    }

    long maxx = V[1];
    for(long i = 2; i <= g; ++i)
        maxx = max(maxx, V[i]);

    fout << maxx << ' ';
}