#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,tw,w[5001],v[5001],i,dp[10001],dp1[10001];
void solve()
{
	int i,j;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=tw;j++)
		{
			if(w[i]<=j)dp1[j]=max(v[i]+dp[j-w[i]],dp[j]);
			else dp1[j]=dp[j];
		}
		for(j=1;j<=tw;j++)dp[j]=dp1[j];
	}
	fout<<dp[tw]<<endl;
}
int main()
{
    fin>>n>>tw;
    for(i=1;i<=n;i++)fin>>w[i]>>v[i];
    solve();
	return 0;
}