#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");

int b[5005], a[10005], dp[10005];

int main()
{
    int n, g;
    f >> n >> g;
    for (int i = 1; i <= n; i++)
        f >> a[i] >> b[i];
    for (int i = 1; i <= n; i++)
    {
        for (int j = g; j >= 1; j--)
        {
            if (j < a[i]) dp[j] = dp[j];
            else dp[j] = max(dp[j], dp[j - a[i]] + b[i]);
        }
    }
    g << dp[g];
    return 0;
}