#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,i,j,w[5010],p[5010],dp[4][10010],g,cw;
int main()
{
    fin>>n>>g;
    for(i=1;i<=n;i++)
        fin>>w[i]>>p[i];
    for(i=1;i<=n;i++)
        for(cw=0;cw<=g;cw++)
        {
            dp[i%2][cw]=dp[1-i%2][cw];
            if(w[i]<=cw)
                dp[i%2][cw]=max(dp[i%2][cw],dp[1-i%2][cw-w[i]]+p[i]);
        }
    fout<<dp[n%2][g];
    return 0;
}