#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
long long d[10001];
int main()
{
    int i,g;
    pair<long long,long long>p[5001];
    int n,G;
    fin>>n>>G;
    for(i=1;i<=n;i++)
        fin>>p[i].first>>p[i].second;
    for(i=1;i<=n;i++)
        for(g=G;g>=1;g--)
            if(p[i].first<=g)
                d[g]=max(d[g],d[g-p[i].first]+p[i].second);
    fout<<d[G];
    return 0;
}