#include <bits/stdc++.h>

using namespace std;

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

int w[5005], p[5005];

int n, gr;
int d[2][10005];

int main()
{
    int i, j;

    f >> n >> gr;

    for (i = 1; i <= n; i++) {
        f >> w[i] >> p[i];
    }

    for (i = 1; i <= n; i++) {
        for (j = 1; j <= gr; j++) {
            d[0][j] = d[1][j];
            if (w[i] <= j)
                d[1][j] = max(d[0][j], d[0][j - w[i]] + p[i]);
        }
    }

    g << d[1][gr] << '\n';

    f.close();
    g.close();

    return 0;