#include <iostream>
#include <fstream>
using namespace std;

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

const int MAXN = 5005;
int n, g, sol;
int w[MAXN], p[MAXN], dp[10005], pos[MAXN];
bool used[MAXN];

int main()
{
    in >> n >> g;
    for (int i = 1; i <= n; ++i) {
        in >> w[i] >> p[i];
    }
    for (int i = 1; i <= g; ++i) dp[i] = -1;

    for (int i = 1; i <= n; ++i) {
        for (int j = g - w[i]; j >= 0; --j) {
            if (dp[j] != -1) {
                dp[j + w[i]] = max(dp[j + w[i]], dp[j] + p[i]);
            }
        }
    }

    for (int i = 1; i <= g; ++i) sol = max(sol, dp[i]);
    out << sol;

    return 0;
}