/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());

class ichimai {
public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      int n, k; cin >> n >> k;
      vector<P> vec(n);
      rep(i, n) {
        cin >> vec[i].first >> vec[i].second;
      }
      sort(all(vec));

      vector<vector<ll>> dp1(n+1, vector<ll>(k+1, 0));
      vector<vector<ll>> dp2(n+1, vector<ll>(k+1, 0));
      rep(i, n) {
        for(int j=0; j<=k; j++) {
          dp1[i+1][j] = dp1[i][j];
          dp2[i+1][j] = dp2[i][j];
        }

        for(int j=0; j+vec[i].first<=k; j++) {
          chmax(dp1[i+1][j+vec[i].first], dp1[i][j] + vec[i].second);
          chmax(dp1[i+1][j+vec[i].first], dp2[i][j] + vec[i].second);
        }
        for(int j=0; j<=k; j++) {
          chmax(dp2[i+1][j], dp1[i][j] + vec[i].second);
        }
      }

      ll ans = 0;
      for(int j=0; j<=k; j++) {
        chmax(ans, dp1[n][j]);
      }
      cout << ans << endl;

    }
};

signed main() {
  ichimai solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}