#include <cstdio>
#define N 5010
#define G 10010
int a[G] , b[G];
int g[N];
int p[N];
int max (int x , int y)
{
    if (x > y)
        return x;
    return y;
}
int main()
{
    freopen ("rucsac.in" , "r" , stdin);
    freopen ("rucsac.out" , "w" , stdout);
    int n , gmax;
    scanf ("%d %d\n" , &n , &gmax);
    for (int i = 1 ; i <= n ; ++i)
    {
        int x , y;
        scanf ("%d %d" , &x , &y);
        g[i] = x;
        p[i] = y;
    }
	for (int i = 1 ; i <= n ; ++i)
	{
		for (int j = 0 ; j <= gmax ; ++j)
		{
			a[j] = b[j];
			if (j >= g[i]  )
				a[j] = max (b[j] , p[i] + b[j - g[i]]);
		}
		for (int j = 1 ; j <= gmax ; ++j)
			b[j] = a[j];
	}
    
    printf ("%d\n" , b[gmax]);
	/*for (int i = 1 ; i <= n ; ++i)
    {
		for (int j = 1 ; j <= gmax ; ++j)
			printf("%d " , a[i][j]);
		printf ("\n");
	 }*/
    return 0;
}