#include<fstream>
#include<iostream>
#include <algorithm>
using namespace std;
ifstream f ("a.in");
ofstream g("a.out");
long long n,gmax,rasp;
long long matr[5001][10001];
int main()
{
    f >> n >> gmax;
    for(int i = 1;i<=n;i++)
    {
        long long gr,cost;
        f >> gr>> cost;
        for (int j=1; j<gr; j++)
            {
                matr[i][j]=matr[i-1][j];
            }
        for (int j=gr;j<=gmax; ++j)
            {
                matr[i][j] = max(matr[i-1][j], matr[i - 1][j - gr] + cost);
            }
    }
    g << matr[n][gmax];

}