#include<cstdio>
#include<string>
#include<algorithm>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "rucsac";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 5000 + 5;
const int GMAX = 10000 + 5;

int N, G, sol;
int W[NMAX];
int P[NMAX];
int D[2][GMAX];

int main() {
    int i, j;

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    scanf("%d%d", &N, &G);

    for(i = 1; i <= N; i++)
        scanf("%d%d", &W[i], &P[i]);

    for(i = 1; i <= N; i++)
        for(j = 1; j <= G; j++) {
            D[i & 1][j] = max(D[(i - 1) & 1][j], (j >= W[i]) * (D[(i - 1) & 1][j - W[i]] + P[i]));
            sol = max(sol, D[i & 1][j]);
        }

    printf("%d\n", sol);

    return 0;
}