#include <bits/stdc++.h>
#define MAX 5000
using namespace std;
struct rucsac{
    int g, p;
};
rucsac A[MAX + 5];
int N, G;
int M[5][2 * MAX + 5];
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", &A[i].g, &A[i].p);
    }
    int l = 0;
    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= G; ++j)
        {
            M[l][j] = M[1 -  l][j];
            if (j - A[i].g >= 0){
                M[1 - l][j] = max(M[1 - l][j], M[l][j - A[i].g] + A[i].p);
            }
        }
    }
    printf("%d", M[1 - l][G]);
    return 0;
}