#include <cstdio>
#include <algorithm>
#include <vector>
#include <iostream>

using namespace std;

#define NMAX 5005
#define GMAX 10005

int N, G, P;
int objects[NMAX][2];
int table[NMAX][GMAX];

inline void read()
{
  freopen("rucsac.in", "r", stdin);
  freopen("rucsac.out", "w", stdout);
  scanf("%d%d", &N, &G);
  for(int i = 0; i < N; i++)
  {
    scanf("%d%d", &objects[i][0], &objects[i][1]);
  }
}

void solve()
{
  for(int i = 1; i <= N; i++)
  {
    int min = objects[i - 1][0] > G ? G : objects[i - 1][0];

    for(int j = 0; j <= G; j++)
      table[i][j] = table[i-1][j];

    for(int j = min; j <= G; j++)
      table[i][j] = max(table[i-1][j - objects[i-1][0]] + objects[i-1][1],
                        table[i-1][j]);
  }
}

int main() {
  read();
  solve();
  printf("%d", table[N][G]);
	return 0;
}