#include <iostream>
#include <fstream>
using namespace std;

ifstream in("rucsac.in");
ofstream out("rucsac.out");

int n,g;
short w[5001];
short p[5001];
int dp[5001][10001];

int main()
{
    in >> n >> g;
    for(int i = 1; i <= n; ++i)
    {
        in >> w[i] >> p[i];
    }

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