#include<cstdio>
#include<algorithm>
using namespace std;
int n,g,w,p,i,dp[10005],best;
int main()
{
	freopen("rucsac.in","r",stdin);
	freopen("rucsac.out","w",stdout);
	scanf("%d%d",&n,&g);
	for(i=1;i<=g;i++) dp[i]=-1;
	for(;n;n--)
	{
	    scanf("%d%d",&w,&p);
	    for(i=g;i>=w;i--)
            if(dp[i-w]!=-1) dp[i]=max(dp[i],dp[i-w]+p);
	}
	for(best=-1,i=0;i<=g;i++) best=max(best,dp[i]);
	printf("%d\n",best);
	return 0;
}