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

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

const int MAX_N = 5000;
const int MAX_C = 10000;
int V[MAX_C];

int main()
{
    int C, N;
    fin >> N >> C;
    int d[MAX_N], v[MAX_N];
    for (int i = 1; i <= N; i++)
    {
        fin >> d[i] >> v[i];
    }

    for (int i = 1; i <= N; i++)
    {
        for (int j = C; j >= d[i]; j--)
        {
            V[j] = max(V[j], V[j - d[i]] + v[i]);
        }
    }

    fout << V[C] << endl;

    fin.close();
    fout.close();

    return 0;
}