#include <bits/stdc++.h>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j, r[5002][10002];
int pr[5002], gr[5002];

int main() {
    fin >> n >> g;
    for(i = 1; i <= n; i++) fin >> gr[i] >> pr[i];
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= g; j++) {
            r[i][j] = r[i - 1][j];
            if(gr[i] <= j) r[i][j] = max(r[i][j], r[i - 1][j - gr[i]] + pr[i]);
        }
    }
    fout << r[n][g];

    return 0;
}