#include <cstdio>
#include <algorithm>
using namespace std;

int N, G, sol[5010][10010], W[5010], P[5010];

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

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

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

            if(W[i] <= cw)
                sol[i][cw] = max(sol[i][cw], sol[i-1][cw-W[i]] + P[i]);
        }
    }

    printf("%d", sol[N][G]);


    return 0;

}