#include <fstream>

using namespace std;

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

const int N = 10000;
int d[N+5];

int main()
{
    int n, G, g, p, last = 0;
    fin >> n >> G;
    d[0] = 0;
    for(int i = 1; i <= G; i++)
    {
        d[i] = -1;
    }
    for(int i = 1; i <= n; i++)
    {
        fin >> g >> p;
        for(int j = last; j >= 0; j--)
        {
            if(j + g > G)
                continue;
            if(d[j] != -1)
            {
                if(d[j + g] < d[j] + p)
                    d[j + g] = d[j] + p;
                if(j + g > last)
                    last = j + g;
            }
        }
    }

    int pmax = 0;
    for(int i = G; i >= 0; i--)
    {
        if(d[i] > pmax)
            pmax = d[i];
    }

    fout << pmax;

    return 0;
}