#include <bits/stdc++.h>

using namespace std;

ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");

int n, dp[10002], w, p, maxx, g;

int main()
{
  fin >> n >> g;
  for (int j = 1; j <= n; j++) {
    fin >> w >> p;
    for (int i = g; i >= w; i--)
      dp[i] = max(dp[i], dp[i - w] + p);
  }
  for (int i = 1; i <= g; i++)
    maxx = max(maxx, dp[i]);
  fout << maxx;
  return 0;
}