#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

const int nmax=5005;

int profit[nmax], cost[nmax];
int dinamica1[10005], dinamica2[10005];

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

    scanf("%d%d", &n, &g);
    for(int i=1;i<=n;i++)
        scanf("%d%d", &cost[i], &profit[i]);
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=g;j++)
        {
            dinamica2[j]=dinamica1[j];
            if(cost[i]<=j)
                dinamica2[j]=max(dinamica2[j], dinamica1[j-cost[i]]+profit[i]);
        }
        for(int j=1;j<=g;j++)
            dinamica1[j]=dinamica2[j];
        memset(dinamica2, 0, sizeof(dinamica2));
    }
    printf("%d\n", dinamica1[g]);

    return 0;
}