#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class Solve {
public:
    void solve() {
        Int N, T;
        cin >> N >> T;
        vector<Int> A(N), B(N);
        vector<pair<Int, Int>> dp(6011, pair<Int, Int>(-1, 0)); // (value, max_weight)
//        vector<vector<Int>> from(N, vector<Int>(6011));
        dp[0] = make_pair(0, 0);


        for (int i = 0; i < N; ++i) {
            cin >> A[i] >> B[i];
        }

        vector<pair<Int, Int>> AB(N);
        for (int i = 0; i < N; ++i) {
            AB[i].first = A[i];
            AB[i].second = B[i];
        }
        sort(all(AB), [](auto a, auto b) {
            if (a.first != b.first) return a.first < b.first;
            return a.second > b.second;
        });

        for (int i = 0; i < N; ++i) {
            A[i] = AB[i].first;
            B[i] = AB[i].second;
        }

        Int ans = 0;
        for (int i = 0; i < N; ++i) {
            for (int j = dp.size(); j >= 0; --j) {
                if (dp[j].first != -1) {
                    Int nj = j + A[i];
                    if (j < T) {
                        chmax(ans, dp[j].first + B[i]);
                    }
                    if (nj < dp.size()) {
                        if (dp[nj].first <= dp[j].first + B[i]) {
                            dp[nj].first = dp[j].first + B[i];
                            chmax(dp[nj].second, max(dp[j].second, A[i]));
//                            from[i][nj] = j;

//                            if (nj - A[i] < T) {
                            if (j < T) {
                                chmax(ans, dp[nj].first);
                            }
                        }
                    } else {
                        if (j < T) {
                            chmax(ans, dp[j].first + B[i]);
                        }
                    }
                }
            }

//            for (int j = 0; j < dp.size(); ++j) {
//                if (j - A[i] < T) {
//                    if(ans == 159){
//                        int a = 10;
//                    }
//                    chmax(ans, dp[j].first);
//                }
//            }
        }

//        for (int i = 0; i < dp.size(); ++i) {
//            if (i - dp[i].second < T) {
//                cerr << i << " " << i - dp[i].second << " " << dp[i].first << endl;
//                chmax(ans, dp[i].first);
//            }
//        }

        cout << ans << endl;


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 1016