#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int dp[5010][5010][2];

struct Piza {
  int cost;
  int value;

  Piza(int cost = -1, int value = -1) {
    this->cost = cost;
    this->value = value;
  }

  bool operator<(const Piza &n) const {
    return cost > n.cost;
  }
};

int main() {
  memset(dp, -1, sizeof(dp));
  int N, K;
  cin >> N >> K;

  vector<Piza> piza_list;
  for (int i = 0; i < N; ++i) {
    Piza piza;
    cin >> piza.cost >> piza.value;
    piza_list.push_back(piza);
  }
  sort(piza_list.begin(), piza_list.end());
  dp[0][0][0] = 0;
  int ans = 0;

  for (int i = 0; i < N; ++i) {
    Piza &piza = piza_list[i];

    for (int k = 0; k <= K; ++k) {
      int nk = k + piza.cost;
      dp[i + 1][k][0] = max(dp[i + 1][k][0], dp[i][k][0]);
      dp[i + 1][k][1] = max(dp[i + 1][k][1], dp[i][k][1]);

      if (dp[i][k][0] != -1 && nk <= K) {
        dp[i + 1][nk][1] = max(dp[i + 1][nk][1], dp[i][k][0] + piza.value);
        ans = max(ans, dp[i + 1][nk][1]);
      }

      if (dp[i][k][1] != -1) {
        dp[i + 1][k][0] = max(dp[i + 1][k][0], dp[i][k][1] + piza.value);
        ans = max(ans, dp[i + 1][k][0]);
      }
    }
  }

  cout << ans << endl;

  return 0;
}