#include<cstdio>
using namespace std;
int n ,G,/*p[10001][10001]*/c[10001], sol = 0;
struct xx { int gr, cost;}v[10001];
void citire(){
    freopen("rucsac.in","rt",stdin);
    scanf("%d%d",&n,&G);
    for(int i=1;i<=n ;++i){
        scanf("%d%d",&v[i].gr,&v[i].cost);
    }
}
/*
void pd(){
    for(int i=1;i<=n;++i)
        for(int j=1;j<=G;++j)
            if(v[i].gr<=j&&v[i].cost+c[i-1][j-v[i].gr]>c[i-1][j]){
                c[i][j]=v[i].cost+c[i-1][j-v[i].gr];
                //p[i][j]=i;
            }
            else{
                c[i][j]=c[i-1][j];
                //p[i][j]=p[i-1][j];
            }
}*/
void pd(){
  c[0] = 0;


	for( int i = 1; i <= n; ++i)
		for( int j = G - v[i].gr; j >= 0; --j) {
			if( c[j+v[i].gr] < c[j] + v[i].cost )
			{
				c[j+v[i].gr] = c[j] + v[i].cost;
				if( c[j+v[i].cost] > sol)
					sol = c[j+v[i].cost];
			}
		}
}
void afisare(){
    int i=n,j=G,k;
    freopen("rucsac.out","wt",stdout);
    printf("%d\n",sol);
   /* while(p[i][j]){
        k=p[i][j];
        //printf("ob%d gr%d cost%d \n",k,v[k].gr,v[k].cost);
        j-=v[p[i][j]].gr;
        while(p[i][j]==k)--i;
    }*/
}
int main(){
    citire();
    pd();
    afisare();
    return 0;
}
/*
// Infoarena - Arhiva Educationala rucsac
// Februrie 2012 Marius Dumitran
// Programare dinamica clasica timp O(N*G) memorie O(G)

#include<string.h>
#include<stdio.h>
#include<vector>
#include<algorithm>
#define maxn 5001
#define maxg 10001

using namespace std;

int W[maxn], P[maxn];
int Optim[maxg];

int main() {

	freopen("rucsac.in", "r", stdin);
	freopen("rucsac.out", "w", stdout);
	int N, G;
	scanf("%d %d", &N, &G);

	for (int i = 1; i <= N; ++i) {
		scanf("%d %d", &W[i], &P[i]);
	}

	Optim[0] = 0;
	int sol = 0;

	for( int i = 1; i <= N; ++i)
		for( int j = G - W[i]; j >= 0; --j) {
			if( Optim[j+W[i]] < Optim[j] + P[i] )
			{
				Optim[j+W[i]] = Optim[j] + P[i];
				if( Optim[j+W[i]] > sol)
					sol = Optim[j+W[i]];
			}
		}
	printf("%d", sol);
	return 0;
}
*/