#include <bits/stdc++.h>

using namespace std;

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

int a[5001], b[5001];
int dp[2][10001];

int main()
{
    int n, g;
    in >> n >> g;

    for (int i=1; i<=n; i++)
        in >> a[i] >> b[i];

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

    out << dp[1][g];

    return 0;
}