#include <bits/stdc++.h>

using namespace std;

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

int n,g,p[5010],w[5010],dp[5010][10010];

int main()
{
    fin >>n >>g;
    for(int i = 1;i <= n;i++)
    {
        fin >>w[i] >>p[i];
    }
    for(int i = 1;i <= n;i++)
    {
        for(int c = 0;c <= g;c++)
        {
            dp[i][c] = dp[i-1][c];
            if(c-w[i] >= 0)
            {
                dp[i][c] = max(dp[i][c],dp[i-1][c-w[i]]+p[i]);
            }
        }
    }
    fout <<dp[n][g];
    return 0;
}