#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

int n, gmax;

int main()
{
    fin >> n >> gmax;
    vector<int> greutate(n), profit(n);
    for (int i = 0; i < n; i++)
        fin >> greutate[i] >> profit[i];

    vector<int> dp(gmax + 1);

    for (int i = 0; i < n; i++)
    {
        for (int j = gmax; j >= greutate[i]; j--)
            dp[j] = max(dp[j], dp[j - greutate[i]] + profit[i]);
    }
    fout << dp[gmax];
}