#include <bits/stdc++.h>

using namespace std;

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

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++) {
            int p1 = (i & 1);
            int p2 = ((i - 1) & 1);

            d[p1][j] = d[p2][j];
            if(gr[i] <= j) d[p1][j] = max(d[p1][j], d[p2][j - gr[i]] + pr[i]);
        }
    }
    fout << d[(n & 1)][g];

    return 0;
}