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

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

const int NMAX = 5001;
const int GMAX = 10001;

int g[NMAX], p[NMAX];
int dp[GMAX];

int main()
{
    int n, G, maxim = 0, i, j;

    fin>>n>>G;
    for(i=1; i<=n; i++)
    {
        fin>>g[i]>>p[i];
    }

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

    fout<<maxim;
    fin.close();
    fout.close()
    return 0;
}