#include <bits/stdc++.h>

using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
int w[5015], p[5015];
int dp[2][10015];
int main()
{
    fin >> n >> g;
    for (int i = 1; i <= n; i++)
        fin >> w[i] >> p[i];

    int cnt = 0;
    for (int i = 1; i <= n; i++, cnt = 1 - cnt)
    {
        for (int j = 0; j <= g; j++)
        {
            dp[1 - cnt][j] = dp[cnt][j];
            if (w[i] <= j)
                dp[1 - cnt][j] = max(dp[1 - cnt][j], dp[cnt][j - w[i]] + p[i]);
        }
    }
    fout << dp[cnt][g];
    return 0;
}