#include <bits/stdc++.h>
#define nmax 5004
#define nnn 10004
using namespace std;

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

int g[nmax], c[nmax], n;
int d[2][nnn], L0, L1, G;

void Citire()
{
    int i;
    fin >> n >> G;
    for (i=1; i<=n; i++)
        fin >> g[i] >> c[i];
}

void Rezolva()
{
    int i, j, maxim;
    L0 = 0; L1 = 1;
    /// initializari
    for (i=1; i<=n; i++)
          d[L0][g[i]] = c[i];

    for (i=2; i<=n; i++)
    {
        for (j=1; j<=G; j++)
           {
               d[L1][j] = max(d[L1][j], d[L0][j]);
               if (j + g[i] <= G)
                  d[L1][j + g[i]] = max(d[L1][j + g[i]], d[L0][j] + c[i]);
           }
        L0 = 1 - L0;
        L1 = 1 - L1;
    }
}

void Afisare()
{
    int i, j;
    int maxim;
    maxim = -100;
    for (j=0; j<=G; j++)
        maxim = max(maxim, d[L1][j]);
    fout << maxim << "\n";
}

int main ()
{
    Citire();
    Rezolva();
    Afisare();
    fin.close();
    fout.close();
    return 0;
}