#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << std::endl; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) std::cerr << std::boolalpha << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); std::cerr << std::noboolalpha;
#else
	#define debug(...)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	template<typename T> class dvector : public std::vector<T> {
	public:
		dvector() : std::vector<T>() {}
		explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
		dvector(const std::vector<T>& v) : std::vector<T>(v) {}
		dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
		dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
		dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
		T& operator[](size_t n) {
			try { return this->at(n); } catch (const std::exception& e) {
				std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
			}
		}
		const T& operator[](size_t n) const {
			try { return this->at(n); } catch (const std::exception& e) {
				std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
			}
		}
	};
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		dbool(const dbool &b) : boolvalue(b.boolvalue) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector<T>& v) {
		for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector< dvector<T> >& vv) {
		for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << std::endl; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << std::endl; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << std::endl; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{" << std::endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << std::endl; } s << "}" << std::endl; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) { 
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
template<typename T> inline void pv(vector<T> &v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

/*-----8<-----template-----8<-----*/

class Item{
public:
	ll value, weight, index;
	Item() {}
	Item(ll value, ll weight, ll index) : value(value), weight(weight), index(index) {}
};
ostream& operator<<(ostream& s, const Item& item) {
	s << "{ " << item.index << " : value = " << item.value << ", weight = " << item.weight << " }";
	return s;
}

/*-----8<-----library-----8<-----*/

const ll N_MAX = 3000;
const ll T_MAX = 3000;
const ll A_I_MAX = 3000;
const ll B_I_MAX = 3000;

ll N, W;
vector<ll> A;
vector<ll> B;

void solve() {
	scanf("%lld%lld", &N, &W);
	A.assign(N, 0);
	B.assign(N, 0);
	rep(i, N) scanf("%lld%lld", &A[i], &B[i]);

	W--;
	vector<Item> items;
	for(ll i=0; i<N; i++){
		Item item(B[i],A[i],i);
		items.push_back(item);
	}

	vector<vector<ll>> dp(N+1, vector<ll>(W+1,0));
	rep(n,N){
		rep(w,W+1){
			if(w < items[n].weight){
				dp[n+1][w]=dp[n][w];
			}else{
				dp[n+1][w]=max(dp[n][w], dp[n][w-items[n].weight]+items[n].value);
			}
		}
	}

	vector<vector<ll>> dprev(N+1, vector<ll>(W+1,0));
	debug(N+1,W+1);
	rep(m,N){
		ll n=N-m;
		rep(w,W+1){
			if(w < items[n-1].weight){
				dprev[n-1][w]=dprev[n][w];
			}else{
				dprev[n-1][w]=max(dprev[n][w], dprev[n][w-items[n-1].weight]+items[n-1].value);
			}
		}
	}

	debug(dp);
	debug(dprev);
	debug(W);
	debug(dp[N][W]);
	ll ans = 0;
	rep(n,N){
		debug(n,n+2);
		rep(w,W+1){
			ll t1=dp[n][w];
			ll t2=dprev[n+1][W-w];
			
			ll t=t1+t2+items[n].value;
			chmax(ans, t);
			if(t==90){debug(w,t1,W-w,t2);}
		}
	}

	printf("%lld\n", ans);
/*
	vector<vector<ll>> dprev(N+1, vector<ll>(W+1,0));
	rep(m,N){
		ll n=N-1-m;
		rep(w,W+1){
			if(w < items[n].weight){
				dprev[n+1][w]=dprev[n][w];
			}else{
				dprev[n+1][w]=max(dprev[n][w], dprev[n][w-items[n].weight]+items[n].value);
			}
		}
	}

	debug(dp);
	debug(dprev);

	ll ans = 0;
	rep(n,N){
		rep(w,W+1){
			ll t1=dp[n][w];
			ll t2=dprev[N-1-n][W-w];
			debug(t1,t2);
			ll t=t1+t2+items[n].value;
			chmax(ans, t);
		}
	}

	printf("%lld\n", ans);
	*/
}

// https://atcoder.jp/contests/abc145/tasks/abc145_e
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 141312