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

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

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 j=G-W[i];j>=0;j--)
        {
            if(sol[j+W[i]] < sol[j] + P[i])
            {
                sol[j+W[i]] = sol[j] + P[i];
                if(SOL < sol[j+W[i]])
                    SOL = sol[j+W[i]];
            }
        }
    }

    printf("%d", SOL);
    return 0;

}