#include <iostream>
#include <fstream>

using namespace std;

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

struct obj
{
    int val, sze;
};

int main()
{
    int n, g, i, j, sum = 0;
    fin >> n >> g;
    int v[501][501];
    obj nr[501];

    for(i = 1; i <= n; i++)
        fin >> nr[i].sze >> nr[i].val;

    for(i = 0; i <= g; i++)
        v[0][i] = 0;
    for(i = 0; i <= n; i++)
        v[i][0] = 0;

    for(i = 1; i <= n; i++)
    {
        sum += nr[i].sze;

        for(j = 1; j <= g; j++)
        {
            if(sum <= j)
                v[i][j] = nr[i].val + v[i-1][j-nr[i].sze];
            else
            {
                if(j < nr[i].sze)
                    continue;
                else
                    v[i][j] = max(nr[i].val + v[i-1][j-nr[i].sze], v[i-1][j]);
            }
        }
    }

    //cout << v[1][1] << ' ' << v[1][7] << '\n';

    /*for(i = 0; i <= n; i++)
    {
        for(j = 0; j <= g; j++)
            cout << v[i][j] << ' ';
        cout << '\n';
    }

    cout << v[n][g];
    **/

    fout << v[n][g] << '\n';

    ///Incercare memorie eficienta

    /*int n, g, i, j, sum = 0;
    f >> n >> g;
    obj nr[501];
    int v[10001], prev[10001];

    for(i = 1; i <= n; i++)
        f >> nr[i].sze >> nr[i].val;

    for(i = 1; i <= n; i++)
        prev[i] = 0;

    for(i = 1; i <= n; i++)
    {
        sum += nr[i].sze;

        for(j = 1; j <= g; j++)
        {
            if(sum <= j)
                v[j] = nr[i].val + prev[j-nr[i].sze];
            else
            {
                if(j < nr[i].sze)
                    continue;
                else
                    v[j] = max(nr[i].val + prev[j-nr[i].sze], prev[j]);
            }
        }

        for(j = 1; j <= n; j++)
            prev[i] = v[i];
    }

    cout << v[g];*/
    return 0;
}