#define _CRT_SECURE_NO_WARNINGS
#include <random>
#include <fstream>
#include <stack>
#include <bitset>
#include <queue>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[5005], p[5005];
int dp[2][10005];
//profit i ob cu suma gr j
int main()
{
    int n, g;
    fin >> n >> g;
    for (int i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
    int currlin = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= g; j++)
        {
            dp[currlin][j] = dp[1 - currlin][j];
            if (j >= w[i] && dp[1 - currlin][j - w[i]] + p[i] > dp[currlin][j])
                dp[currlin][j] = dp[1 - currlin][j - w[i]] + p[i];
        }
        currlin = 1 - currlin;
    }
    int maxx = 0;
    for (int i = 1; i <= g; i++)
        maxx = max(maxx, dp[1-currlin][i]);
    fout << maxx;
    return 0;
}