#include <iostream>
#include <cstdio>

using namespace std;

int maxim(int a, int b)
{
    return a > b ? a : b;
}
int n, g, best[10005];

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

    int w, p = 0;
    scanf("%d %d\n", &n, &g);
    for (int i = 0; i < n; i++)
    {
        scanf("%d %d", &w, &p);
        for (int  j = g; j >= w; j--)
        {
            best[j] = maxim(best[j], best[j - w] + p);
        }
    }
    printf("%d", best[g]);

    return 0;
}