#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}

int N, I;
int S[1009], A[1009];

int main(){
  cin >> N >> I;
  for(int i = 1; i <= N; ++i) cin >> S[i] >> A[i];
  int INF = 1<<30;
  vector<vector<int>> dp(N+1, vector<int>(I+1, -INF));
  dp[0][0] = 0;
  for(int i = 1; i <= N; ++i){
    for(int j = 0; j <= I; ++j){
     if(j>=S[i]) chmax(dp[i][j], dp[i-1][j-S[i]]+A[i]);
     chmax(dp[i][j], dp[i-1][j]);
    }
  }
  int ans = 0;
  for(int i = 0; i <= I; ++i) ans = max(ans, dp[N][i]);
  cout << ans << endl;
  /*
  for(int i = 0; i <= N; ++i){
    for(int j = 0; j <= I; ++j){
      cout << dp[i][j] << " ";
    }
    cout << endl;
  }
  */

}