#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int Nmax = 5010;
const int Gmax = 10010;

int N , G , i , j;
int g[Nmax] , p[Nmax] , d[Gmax];

int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);

    scanf("%d %d", &N, &G);

    for (i = 1; i <= N; ++i)
        scanf("%d %d", &g[i], &p[i]);

    for (i = 1; i <= N; ++i)
     for (j = G; j >= 1; --j)
        if (j - g[i] >= 0)
          d[j] = max(d[j] , d[j-g[i]] + p[i]);


    printf("%d\n", d[G]);


    return 0;
}