#include <bits/stdc++.h>
using namespace std;

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

int main()
{
    int G, N;
    fin >> N >> G;
    int w[5000], p[5000];
    int rez[10000];

    for (int i = 1; i <= N; i++)
    {
        fin >> w[i] >> p[i];
    }

    for (int i = 1; i <= N; i++)
    {
        for (int j = G; j >= w[i]; j--)
        {
            if (j > w[i])
            {
                // arr[i][j] = max(arr[i - 1][j], arr[i - 1][j - w[i - 1]] + p[i - 1]);

                rez[j] = max(rez[j], rez[j - w[i]] + p[i]);
            }
            else
            {
                rez[j] = rez[j];
            }
        }
    }

    fout << rez[G] << endl;

    return 0;
}