#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";

const int MX = 3000;
int dp[MX+1][MX];

int main()
{
    int n, t;
    cin >> n >> t;
    vector<pint> ab;
    rep(i,n) {
        int a, b;
        cin >> a >> b;
        ab.emplace_back(a,b);
    }
    ssort(ab);
    rep(i,MX) rep(j,MX) { dp[i][j] = 0; }
    // repSE(i,1,n+1) {
    //     int a = ab[i-1].first, b = ab[i-1].second;
    //     rep(j,t) {
    //         chmax(dp[i][j], dp[i-1][j]);
    //         if (j + a < MX) chmax(dp[i][j+a], dp[i-1][j] + b);
    //     }
    // }
    // int ans = 0;
    // rep(i,n) {
    //     int ret = dp[i+1][t-1];
    //     repSE(j,i+1,n) {
    //         chmax(ret, dp[i+1][t-1] + ab[j].second);
    //     }
    //     chmax(ans, ret);
    // }
    int ans = 0;
    rep(i,n) {
        int a = ab[i].first, b = ab[i].second;
        rep(j,t) {
            chmax (dp[i+1][j], dp[i][j]);
            if (j+a < MX) chmax (dp[i+1][j+a], dp[i][j] + b);
        }
        int now = dp[i][t-1];
        chmax(ans, now + b);
    }
    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 35584