#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int n,k;cin>>n>>k;
    vector<int> p(n),d(n);
    rep(i,n) cin>>p[i]>>d[i];

    vector<int> ord(n);
    iota(ALL(ord),0);
    sort(ALL(ord),[&](int l,int r){return p[l]>p[r];});

    vector<vector<vector<int>>> dp(n+1,vector<vector<int>>(k+1,vector<int>(2,-INF)));
    dp[0][0][0]=0;

    rep(i,n){
        rep(j,k+1){
            chmax(dp[i+1][j][0],dp[i][j][0]);
            chmax(dp[i+1][j][1],dp[i][j][1]);

            int cost=p[ord[i]],val=d[ord[i]];
            if(j+cost<=k){
                chmax(dp[i+1][j+cost][1],dp[i][j][0]+val);
                chmax(dp[i+1][j+cost][1],dp[i][j][1]+val);
            }
            chmax(dp[i+1][j][0],dp[i][j][1]+val);
        }
    }
    int res=0;
    rep(i,n+1)rep(j,k+1)rep(l,2) chmax(res,dp[i][j][l]);
    cout<<res<<endl;
    return 0;
}