#include <iostream>
#include <fstream>

using namespace std;

ifstream fi("rucsac.in");
ofstream fo("rucsac.out");

int n,k;
int P[5001], G[5001];
int DP[10001];

int main()
{
    fi >> n >> k;
    for (int i = 1; i <= n; ++i)
        fi >> G[i] >> P[i];
    for (int i = 1; i <= n; ++i)
        for(int j = k; j > 0; --j)
            if (j >= G[i])
                DP[j] = max(DP[j], DP[j - G[i]] + P[i]);
            else
                DP[j] = DP[j];
    fo<<DP[k];
    fi.close();
    fo.close();
    return 0;
}