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

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

vector <pair<int, int>> ob;
vector <int> d;
vector <int> prevD;

int main()
{
    int n, g;
    fin>>n>>g;
    int i, j;
    ob.push_back({0, 0});
    for(i=0; i<n; i++) {
        int w, p;
        fin>>w>>p;
        ob.push_back({w, p});
    }
    //retin o singura linie de g elemente si o actualizez de n ori
    d.resize(g+1);
    prevD.resize(g+1);
    for(i=1; i<=n; i++) {
        for(j=0; j<=g; j++) {
            if(j < ob[i].first) {
                d[j] = prevD[j];
            }
            else {
                d[j] = max(ob[i].second + prevD[j - ob[i].first], prevD[j]);
            }
        }
        prevD = d;
    }
    fout<<d[g];
}






/*#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

vector <pair<int, int>> ob;
int d[5005][10005];

int main()
{
    int n, g;
    fin>>n>>g;
    int i, j;
    ob.push_back({0, 0});
    for(i=0; i<n; i++) {
        int w, p;
        fin>>w>>p;
        ob.push_back({w, p});
    }
    //d[0][j] = 0, oricare ar fi j=0->g
    for(i=1; i<=n; i++) {
        for(j=0; j<=g; j++) {
            if(j < ob[i].first) {
                d[i][j] = d[i-1][j];
            }
            else {
                d[i][j] = max(ob[i].second + d[i-1][j - ob[i].first], d[i-1][j]);
            }
        }
    }
    fout<<d[n][g];
}*/