#include <iostream>

using namespace std;
int i,j,dp[1010][10010],n,gm,p[10010],w[10010],x,W;
int spc()
{
    for (int i = 1; i <= n; ++i)
    {
        for (int cap = 0; cap <= W; ++cap)
        {
            dp[i][cap] = dp[i-1][cap];
            if (cap - w[i] >= 0)
            {
                int sol_aux = dp[i-1][cap - w[i]] + p[i];
                dp[i][cap] = max(dp[i][cap], sol_aux);
            }
        }
    }
    return dp[n][W];
}
int main()
{
    cin>>n>>W;
    for (i=1;i<=n;i++)
    {
        cin>>p[i]>>w[i];
    }
    x=spc();
    cout<<x;
    return 0;
}