#include <fstream>
#include<cstdlib>
#include<cstring>
using namespace std;
int G, g, i, n, p, Max, j;
int v[10001];

int main () {
    ifstream fin ("rucsac.in");
    ofstream fout ("rucsac.out");
    fin>>n>>G;

    for (i=1;i<=G;i++) {
        v[i]=-1;
    }

    for (i=1;i<=n;i++) {
        fin>>g>>p;
        for (j=G-g;j>=0;j--) {
            if (v[j]!=-1) {
                if (v[j+g]<v[j]+p)
                    v[j+g]=v[j]+p;
            }
        }
    }

    for (i=1;i<=G;i++)
        Max=max(Max,v[i]);

    fout<<Max;
    return 0;
}