#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define MAX 5005
#define MAX1 10001
int a[2][MAX1], p[MAX], w[MAX];

int main()
{
    int n,g;
    fin >> n >> g;
    for(int i = 1; i<=n; i++)
        fin >> w[i] >> p[i];

    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=g; j++)
        {
            if(j-w[i]>=0)
                a[i%2][j] = max(a[(i-1)%2][j-w[i]]+p[i], a[(i-1)%2][j]);
            else
                a[i%2][j] = a[(i-1)%2][j];
        }
    fout << a[n%2][g] << "\n";
    return 0;
}