#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),[](int a, int b){return a > b;});
#define ALL(X) (X).begin(),(X).end()
#define INF 999999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

// ナップサック問題の拡張版
struct menu{
    int time,value;
    menu(int t, int v):time(t),value(v){}
};

int N,T;
vector<menu> M;

// 処理が重くて間に合わない。
// int dp_d[3010][3010][9000010];
// int dp(int const& i, int const& t, int const& v){
//     if(dp_d[i][t][v]) return dp_d[i][t][v];
//     if(2*t > 2*T-1) return dp_d[i][t][v] = v;
//     else if(i==N-1) return dp_d[i][t][v] = v + M[i].value;
//     else return dp_d[i][t][v] = max(dp(i+1,t,v), dp(i+1,t+M[i].time,v+M[i].value)); 
// }

int DP_D[3010][3010];
int DP(int const& i,int const& j){
    if(i<0|j<=0) return 0;
    if(DP_D[i][j]) return DP_D[i][j];
    else if(j<M[i].time) return DP_D[i][j] = DP(i-1,j);
    else return DP_D[i][j] = max(DP(i-1,j) , M[i].value + DP(i-1,j-M[i].time));
}

int main()
{
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif

    fast_io();
    cin >> N >> T;
    M.assign(N,menu(0,0));
    FOR(i,0,N) cin >> M[i].time >> M[i].value;
    sort(M.begin(),M.end(),[](menu a, menu b){return a.time < b.time;});

    int ans=0;
    FORR(i,N-1,0) ans = max(ans, M[i].value + DP(i-1,T-1));
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 35456