#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
int w[101],p[101],a[101][101],N,G;

int maxim(int a, int b)
{
    if(a>b)
        return a;
    return b;
}

int main()
{
    ifstream f("rucsac.in");
    f >> N >> G;
    int i,g;
    for(i=1; i<=N; ++i)
        f >> w[i] >> p[i];
    f.close();
    for(i=1; i<=N; ++i)
        for(g=1; g<=G; ++g)
        {
            a[i][g]=a[i-1][g];
            if(w[i]<=g)
                a[i][g]=max(a[i][g],a[i-1][g-w[i]]+p[i]);
        }
    ofstream gin("rucsac.out");
    gin << a[N][G];
    gin.close();
    return 0;
}