#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[2][10001];
 
int main()
{
    in >> n >> g;
    int la = 1, lb = 0;
    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[la][j] = max(dp[lb][j - w[i]] + p[i], dp[lb][j]);
            }
            else
                dp[la][j] = dp[lb][j];
        }
        if(la == 0)
            la = 1;
        else
            la = 0;
 
        if(lb == 0)
            lb = 1;
        else
            lb = 0;
    }
    int mx = dp[lb][g];
    out << mx;
    return 0;
}