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

const int MAXN = 5005;
const int MAXG = 10005;

int n, g;
int dp[MAXN][MAXG], W[MAXN], P[MAXN];

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]);
    int l = 0;
    for (int i = 1; i <= n; ++i, l = 1 - l)
    {
        for (int cw = 0; cw <= g; ++cw)
        {
            dp[1 - l][cw] = dp[l][cw];
            if (cw >= W[i])
                dp[1 - l][cw] = max(dp[1 - l][cw], dp[l][cw - W[i]] + P[i]);
        }
    }
    printf("%d\n", dp[l][g]);
    return 0;
}