#include <cstdio>
#include <algorithm>
using namespace std;
int n, g, i, j, w[5001], p[5001], lin;
int cw, m[2][5001];
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", &w[i], &p[i]);

    for(i=1;i<=n;i++, lin=1-lin)
        for(cw=0;cw<=g;cw++)
        {
            m[1-lin][cw]=m[lin][cw];
            if(w[i]<=cw)
                m[1-lin][cw]=max(m[1-lin][cw], m[lin][cw-w[i]]+p[i]);
        }
    printf("%d\n", m[lin][g]);
    return 0;
}