#include <fstream>
using namespace std;
int n, g, w, p, i, j, Max;
int v[10001];
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");

int main () {
    fin>>n>>g;
    for (i=1;i<=g;i++)
        v[i]=-1;

    for (i=1;i<=n;i++) {
        fin>>w>>p;
        for (j=g-w;j>=0;j--) {
            if (v[j]!=-1) {
                if (v[j+w]<v[j]+p)
                    v[j+w]=v[j]+p;
            }
        }
    }
    for (i=1;i<=g;i++) {
        Max=max(Max, v[i]);
    }
    fout<<Max;
    return 0;
}