#include <cstdio>
#include <algorithm>

using namespace std;

int n, g;
int w, p;
int dp[10005];

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, &p);
        for(int j=g; j>=w; j--)
            dp[j]=max(dp[j-w]+p, dp[j]);
    }
    printf("%d", dp[g]);

    return 0;
}