#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

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
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

ll N, T;

void knapsack(VV& dp, VI& W, VI& V){
  ll C = T-1;
  // i番目以降を見て
  // jキャパシティに入る最大の価値
  for(int i=N-1; i>=0; i--){
      FOR(j, 0, C+1){
          if(W[i]>j){
              // 入らない
              dp[i][j] = dp[i+1][j];
          }
          else{
              ll v0 = dp[i+1][j];
              ll v1 = dp[i+1][j-W[i]] + V[i];
              dp[i][j] = max(v0, v1);
          }
      }
  }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> N >> T;

    VI A(N);
    VI B(N);
    rep(i, N){
      cin >> A[i] >> B[i];
    }

    vector<vector<ll>> dp0(3010, vector<ll>(3010, 0));
    vector<vector<ll>> dp1(3010, vector<ll>(3010, 0));

    knapsack(dp0, A, B);
    
    auto C = A; reverse(ALL(C));
    auto D = B; reverse(ALL(D));
    knapsack(dp1, C, D);

    debug(dp0[0][T-1]);
    debug(dp0[1][T-1]);
    debug(dp1[0][T-1]);
    debug(dp1[1][T-1]);

    ll ans = B[0] + dp0[1][T-1];
    debug(ans);
    chmax(ans, B[N-1] + dp1[1][T-1]);
    debug(ans);
    ll i = 2;

    // ll taste = dp0[i+1][T-1-2] + dp1[N-i][2] + B[i];
    // debug(taste, dp0[i+1][T-1-2], dp1[N-i][2]);
    // return 0;

    FOR(i, 1, N-1){
      rep(left_capacity, T){
        ll right_capacity = T-1 - left_capacity;
        ll taste = dp0[i+1][left_capacity] + dp1[N-i][right_capacity] + B[i]; 
        chmax(ans, taste);
      }
      // debug(dp0[i+1][T-1], dp1[N-i+1][T-1], taste);
      
    } 
    p(ans);

    return 0;
}

Measured memory_bytes: 142208