#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, k;
    cin >> n >> k;
    vector<P> v(n);
    rep(i,n) cin >> v[i].first >> v[i].second;
    sort(v.begin(), v.end(), greater<P>());
    int a[n], b[n];
    rep(i,n){
        a[i] = v[i].first;
        b[i] = v[i].second;
    }
    

    int dp[n][k+1][2];
    rep(i,n)rep(j,k+1)rep(l,2)dp[i][j][l] = 0;

    rep(i,n){
        if(i == 0){
            dp[0][a[i]][1] = b[i];
        }else{
            rep(j,k+1){
                dp[i][j][0] = dp[i-1][j][0];
                if(dp[i-1][j][1] != 0){
                    dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][1] + b[i]);
                }
            }
            rep(j,k+1){
                dp[i][j][1] = dp[i-1][j][1];
                if(j-a[i] >= 0){
                    dp[i][j][1] = max(dp[i][j][1], dp[i-1][j-a[i]][0] + b[i]);
                }
            }
        }
    }

    int ans = 0;
    rep(j,k+1)rep(l,2) ans = max(ans, dp[n-1][j][l]);
    cout << ans << endl;
    return 0;
}