3624

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef __int64 LL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)

#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}


// code begin
int N,M;
struct node
{
	int v;
	int c;
};
node data[3403];
int DP[12881];
int main()
{
	read;
	write;
	while(scanf("%d %d",&N,&M)==2)
	{
		for(int i=0;i<N;i++)
		{
			scanf("%d %d",&data[i].v,&data[i].c);
		}
		memset(DP,0,sizeof(DP));
		for(int i=0;i<N;i++)
		{
			for(int j=M;j>=0;j--)
			{
				if(j-data[i].v<0) break;
				DP[j] = TMAX(DP[j],DP[j-data[i].v]+data[i].c);
			}
		}
		int ans =0;
		for(int i=M;i>=0;i--)
		{
			if(DP[i]>ans) ans=DP[i];
		}
		printf("%d\n",ans);
	}
	return 0;
}