#include <fstream>
#include <iostream>
#include <cmath>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, g;
int w[5005], p[5005];
int a[5005][10005];

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