#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int MAXN = 5010;
const int MAXG = 10010;
int N, G;
int W[MAXN], P[MAXN];
int D[MAXN][MAXG];
int main() {
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> N >> G;
    for (int i = 1; i <= N; ++i) {
        fin >> W[i] >> P[i];
    }
    for (int i = 1; i <= N; ++i) {
        for (int cw = 0; cw <= G; ++cw) {
            D[i][cw] = D[i - 1][cw];
            if (W[i] <= cw) {
                D[i][cw] = max(D[i][cw], D[i - 1][cw - W[i]] + P[i]);
            }
        }
    }
    fout << D[N][G] << '\n';
    return 0;
}