#include <bits/stdc++.h>

#define N 10000 * 5000 + 5 
#define oo 0x3f3f3f3f
#define mod 666013

using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, m;
vector<pair<int, int>> gv;
int dp[N];

void read() {
  f>>n>>m;
  int x, y;
  for(int i = 1;i <= n;++i) {
    f>>x>>y;
    gv.push_back(make_pair(x, y));
  }
}

void solve() {
  int maxim = 0;
  for(const auto& pr : gv) {
    for(int i = m - pr.first;i >= 0;--i) {
      dp[i + pr.first] = max(dp[i + pr.first], dp[i] + pr.second);
      maxim = max(dp[i + pr.first], maxim);
    }
  }
  g<<maxim;
} 

int main() {
  read();
  solve();
  return 0;
}