#include<fstream>
#include<iostream>
#include <algorithm>
using namespace std;
ifstream f ("rucsac.in");
ofstream g("rucsac.out");
long long n,gmax,rasp;
long long v[10001];
int main()
{
    f >> n >> gmax;
    for(int i = 1;i<=n;i++)
    {
        long long gr,cost;
        f >> gr>> cost;
        for (int j=gmax;j>=gr; j--)
            {
                v[j] = max(v[j],v[j-gr]+cost);
            }
    }
    g << v[gmax];

}