#include <bits/stdc++.h>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main() {
  int n, m;
  fin >> n >> m;
  vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0));
  for (int i = 1; i <= n; i++) {
    int w, p;
    fin >> w >> p;
    dp[i][w] = max(dp[i - 1][w], p);
    for (int j = 0; j <= m; j++) {
      dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      if (j + w <= m)
        dp[i][j + w] = max(dp[i - 1][j + w], dp[i - 1][j] + p);
    }
  }
  int ans = 0;
  for (int i = 0; i <= m; i++)
    ans = max(ans, dp[n][i]);
  fout << ans;
}