#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int N, G;
int W[10001], P[10001];
int A[2][10001];

int main()
{
    fin >> N >> G;
    for (int i = 1; i <= N; ++i)
        fin >> W[i] >> P[i];

    int l = 0;
    for (int i = 1; i <= N; ++i, l = 1 - l)
        for (int gr = 0; gr <= G; ++gr)
        {
            A[1 - l][gr] = A[l][gr];

            if (gr >= W[i])
                A[1 - l][gr] = max(A[1 - l][gr], A[l][gr - W[i]] + P[i]);
        }

    fout << A[l][G];

    fin.close();
    fout.close();
    return 0;
}