#include <cstdio>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define MAXN 5010
#define MAXG 10010
 
int N, G, Pmax;
int W[MAXN], P[MAXN];
int D[MAXN][MAXG];
 
int main()
{
    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]);
        }
    Pmax = D[N][G];
    fout <<Pmax;
 
    return 0;
}