#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 1e4+5;
int n, g, w[NMAX], p[NMAX], dp[NMAX], ans = 0;

inline void solve()
{
    for(int i=1;i<=n;++i)
    {
        for(int j=g-w[i];j>=0;--j)
        {
            if(dp[j+w[i]] < dp[j] + p[i])
            {
                dp[j+w[i]] = dp[j]+p[i];
                ans = max(dp[j+w[i]], ans);
            }
        }
    }
    fout << ans;
}

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