#include <bits/stdc++.h>

using namespace std;

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

int n, cost, w[5005], p[5005], dp[10005];

signed main ()
{
    fin >> n >> cost;
    for (int i=1; i<=n; i++)
        fin >> w[i] >> p[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=cost; j>=w[i]; j--)
            dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
    }
    fout << dp[cost];
}